It is known that predictor-corrector methods in a large neighborhood of the central path are among the most efficient interior point methods (IPMs) for linear optimization (LO) problems. The best iteration bound based on the classical logarithmic barrier function is O ( n log n ǫ ) . In this paper we propose a family of self-regular proximity based predictorcorrector (SR-PC) IPM for LO in a lar...

in this paper‎, ‎we propose a modification of the second order method‎ ‎introduced in [‎‎q. li and ‎x‎. ‎y. ‎wu‎, a two-step explicit $p$-stable method for solving second order initial value problems‎, ‎textit{‎appl‎. ‎math‎. ‎comput‎.}‎ {‎138}‎ (2003)‎, no. 2-3, ‎435--442‎] for the numerical solution of‎ ‎ivps for second order odes‎. ‎the numerical results obtained by the‎ ‎new method for some...

In this work, we propose a predictor-corrector interior point method for linear programming in a primal-dual context, where the next iterate is chosen by the minimization of a polynomial merit function of three variables: the first is the steplength, the second defines the central path and the third models the weight of a corrector direction. The merit function minimization is performed by rest...

Motivated by a numerical example which shows that a feasible version of Mehrotra’s original predictor-corrector algorithm might be inefficient in practice, Salahi et al., proposed a so-called safeguard based variant of the algorithm that enjoys polynomial iteration complexity while its practical efficiency is preserved. In this paper we analyze the same Mehrotra’s algorithm from a different per...