In this paper, a class of generalized general mixed quasi variational inequalities is introduced and studied. We prove the existence of the solution of the auxiliary problem for the generalized general mixed quasi variational inequalities, suggest a predictor-corrector method for solving the generalized general mixed quasi variational inequalities by using the auxiliary principle technique. If ...

This paper is the basic one of the series resulting from the minisymposium entitled “Recent Advances for the Parareal in Time Algorithm” that was held at DD15. The parareal in time algorithm is presented in its current version (predictor-corrector) and the combination of this new algorithm with other more classical iterative solvers for parallelization which makes it possible to really consider...

An interior point method (IPM) defines a search direction at each interior point of a region. These search directions form a direction field which in turn gives rise to a system of ordinary differential equations (ODEs). The solutions of the system of ODEs can be viewed as underlying paths in the interior of the region. In [C.-K. Sim and G. Zhao, Math. Program. Ser. A, 110 (2007), pp. 475–499],...

In this paper, the sharp interface, direct forcing immersed boundary method developed by Yang and Stern (A simple and efficient direct forcing immersed boundary framework for fluidstructure interactions, J. Comput. Phys. 231 (2012) 5029-5061) is applied to the fully resolved simulation of particulate flow. This method uses a discrete forcing approach and maintains a sharp profile of the fluid/s...

SDPA (SemiDe nite Programming Algorithm) is a C++ implementation of a Mehrotra-type primal-dual predictor-corrector interior-point method for solving the standard form semide nite program and its dual. We report numerical results of large scale problems to evaluate its performance, and investigate how major time-consuming parts of SDPA vary with the problem size, the number of constraints and t...

A class of explicit discontinuous Galerkin schemes is described which time approximation is based on a predictor corrector formulation. The approximation at the new time level is obtained in one step with use of the information from the direct neighbors only. This allows to introduce a local time-stepping for unsteady simulations with the property that every grid cell runs with its own optimal ...

In this article a primal-dual interior-point method for solving linear programs is proposed. A new approach for generating higher-order search directions, and a new method for an eecient higher-order subspace search along several search directions are the basis of the proposed extension. The subspace search is reduced to a linear program in several variables. The method using the simplest (two-...

Abstract We propose a new predictor–corrector interior-point algorithm for solving Cartesian symmetric cone horizontal linear complementarity problems, which is not based on usual barrier function. generalize the introduced in Darvay et al. (SIAM J Optim 30:2628–2658, 2020) to problems product of cones. apply algebraically equivalent transformation technique proposed by (Adv Model 5:51–92, 2003...

In the literature, various types of parallel methods for integrating nonsti initial-value problems for rst-order ordinary di erential equation have been proposed. The greater part of them are based on an implicit multistage method in which the implicit relations are solved by the predictor–corrector (or xed point iteration) method. In the predictor–corrector approach the computation of the comp...

Abstract We study a predictor-corrector interior-point algorithm for solving general linear complementarity problems from the implementation point of view. analyze method proposed by Illés, Nagy and Terlaky [1] that extends published Potra Liu [2] to problems. A new determining step size corrector direction is presented. Using code implemented in C++ programming language, we can solve large-sca...