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

DOI10.1007/BF01302893zbMATH Open0835.90048OpenAlexW1758732114MaRDI QIDQ1804577FDOQ1804577

Levent Tunçel

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

Recommendations

• Quadratic convergence of potential-reduction methods for degenerate problems
• A new wide neighborhood primal-dual predictor-corrector interior-point method for linear programming
• A globally convergent primal-dual interior point algorithm for convex programming
• scientific article; zbMATH DE number 1054749
• A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood

zbMATH Keywords

primal-dual interior-point methodspotential reduction algorithmwide neighborhoods

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

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

Cited In (3)

• On the convergence of the iteration sequence in primal-dual interior- point methods
• Quadratic convergence of potential-reduction methods for degenerate problems
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming

This page was built for publication: On the convergence of primal-dual interior-point methods with wide neighborhoods

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