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

DOI10.1016/J.APNUM.2006.09.009MaRDI QIDQ997220zbMATH OpenOpenAlexFDO

Authors 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 programmingiteration complexityquadratic convergenceneighborhoodspredictor-corrector methodsinterior-point algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• A new wide neighborhood primal-dual predictor-corrector interior-point method for linear programming
• Neighborhood-following algorithms for linear programming
• A wide-neighborhood predictor-correcting algorithm for linear programming
• Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
• A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood

Cites work

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

Cited in

(3)

• An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
• On central-path proximity measures in interior-point methods
• Neighborhood-following algorithms for linear programming

This page was built for publication: Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997220)