On the convergence of primal-dual interior-point methods with wide neighborhoods

DOI10.1007/BF01302893zbMath0835.90048OpenAlexW1758732114MaRDI QIDQ1804577

Tunçel, Levent

Publication date: 15 May 1995

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01302893

zbMATH Keywords

primal-dual interior-point methodspotential reduction algorithmwide neighborhoods

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Convergence behavior of interior-point algorithms
• A new polynomial-time algorithm for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• Polynomial affine algorithms for linear programming
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• Quadratic Convergence in a Primal-Dual Method
• A Centered Projective Algorithm for Linear Programming
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
• An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item