Further development of multiple centrality correctors for interior point methods

Abstract This paper addresses the role of centrality in the implementation of interior point methods. We provide theoretical arguments to justify the use of a symmetric neighbourhood, and translate them into computational practice leading to a new insight into the role of re-centering in the implementation of interior point methods. Second-order correctors, such as Mehrotra’s predictor–corrector, can occasionally fail: we derive a remedy to such difficulties from a new interpretation of multiple centrality correctors. Through extensive numerical experience we show that the proposed centrality correcting scheme leads to noteworthy savings over second-order predictor–corrector technique and previous implementations of multiple centrality correctors.

[1]  John M. Mulvey,et al.  Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives , 1993, SIAM J. Optim..

[2]  Jacek Gondzio,et al.  Implementation of Interior Point Methods for Large Scale Linear Programming , 1996 .

[3]  J. Gondzio HOPDM (version 2.12) — A fast LP solver based on a primal-dual interior point method , 1995 .

[4]  Yin Zhang,et al.  The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method , 1996, SIAM J. Optim..

[5]  F. Jarre,et al.  Extending mehrotra's corrector for linear programs , 1997 .

[6]  Sanjay Mehrotra,et al.  Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method , 2005, SIAM J. Optim..

[7]  Stephen J. Wright,et al.  PCx user guide , 1997 .

[8]  Jacek Gondzio,et al.  Multiple centrality corrections in a primal-dual method for linear programming , 1996, Comput. Optim. Appl..

[9]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[10]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[11]  Roy E. Marsten,et al.  On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming , 1992, SIAM J. Optim..

[12]  Jiming Peng,et al.  On Mehrotra-Type Predictor-Corrector Algorithms , 2007, SIAM J. Optim..

[13]  Madhu V. Nayakkankuppam,et al.  Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programming , 1999 .

[14]  Yinyu Ye,et al.  A primal-dual interior point method whose running time depends only on the constraint matrix , 1996, Math. Program..

[15]  Coralia Cartis On the Convergence of a Primal-Dual Second-0rder Corrector Interior Point Algorithm for Linear Programming , 2005 .

[16]  Jorge J. Moré,et al.  Benchmarking optimization software with performance profiles , 2001, Math. Program..

[17]  Shinji Mizuno,et al.  On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..

[18]  C. Cartis Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming , 2009 .

[19]  Stephen J. Wright Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.