We develop a new constraint-reduced infeasible predictor-corrector interior point method for semidefinite programming, and we prove that it has polynomial global convergence and superlinear local convergence. While the new algorithm uses HKM direction in predictor step, it adopts AHO direction in corrector step to achieve a faster approach to the central path. In contrast to the previous constr...

An interior point method for monotone linear complementarity problems acting in a wide neighborhood of the central path is presented. The method has O( √ nL)iteration complexity and is superlinearly convergent even when the problem does not possess a strictly complementary solution.

In this paper we study numerical methods for hybrid fuzzy differential equations by an application of the Adams fifth order predictor-corrector method for fuzzy differential equations. We prove a convergence result and give numerical examples to illustrate the theory.

In this paper, we give a new method for solving large scale problems. The basic idea of this method depends on implementing the conjugate gradient as a corrector into a continuation method. We use the Euler method as a predictor. Adaptive steplength control is used during the tracing of the solution curve. We present some of our experimental examples to demonstrate the efficiency of the method.

page 1 Predictor Corrector Methods Predictor Corrector Methods form the basis of the most successful codes (Variable Step Variable Order Methods) for the solution of initial value problems of ordinary differential equations. Briefly, these methods have been successful because they occur in naturally arising families covering a range of orders, they have reasonable stability properties, and they...

The predictor-corrector method for following a reduced gradient (RGF) to determine saddle points [Quapp, W. et al., J Comput Chem 1998, 19, 1087] is further accelerated by a modification allowing an implied corrector step per predictor but almost without additional costs. The stability and robustness of the RGF method are improved, and the new version in addition reduces the number of gradient ...

This paper proposes a predictor-corrector primal-dual interior point method which introduces line search procedures IPLS in both the predictor and corrector steps. The Fibonacci search technique is used in the predictor step, while an Armijo line search is used in the corrector step. The method is developed for application to the economic dispatch ED problem studied in the field of power system...

We present a new corrector-predictor method for solving sufficient linear complementarity problems for which a sufficiently centered feasible starting point is available. In contrast with its predictor-corrector counterpart proposed by Miao, the method does not depend on the handicap κ of the problem. The method has O((1+ κ)√nL)-iteration complexity, the same as Miao’s method, but our error est...

We establishe the polynomial convergence of a new class of pathfollowing methods for linear complementarity problems (LCP). Namely, we show that the predictor-corrector methods based on the L2 norm neighborhood. Mathematics Subject Classification: 90C33, 65G20, 65G50