Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions

DOI10.1016/j.apnum.2006.09.009zbMath1121.65072MaRDI QIDQ997220

J. Martínez

Publication date: 23 July 2007

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2006.09.009

zbMATH Keywords

linear programming; interior-point algorithms; quadratic convergence; predictor-corrector methods; iteration complexity; neighborhoods

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C05: Linear programming

90C51: Interior-point methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Karmarkar's linear programming algorithm and Newton's method
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
• Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
• The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
• A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
• On the Implementation of a Primal-Dual Interior Point Method
• Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems
• Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
• A New Infinity-Norm Path Following Algorithm for Linear Programming
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
• An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
• Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path
• On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
• The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems
• A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function