Quadratic convergence of potential-reduction methods for degenerate problems

DOI10.1007/S101070100208MaRDI QIDQ5930730zbMATH OpenFDO

Authors Reha H. Tütüncü

Publication date 24 April 2001

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

global and local convergencelinear programmingprimal-dual interior-point

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• On the convergence of primal-dual interior-point methods with wide neighborhoods
• On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
• Quadratic Convergence in a Primal-Dual Method
• Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems
• Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited

Cited in

(5)

• On the convergence rate of the duality gap in a symmetric primal-dual potential reduction algorithm
• On the convergence of primal-dual interior-point methods with wide neighborhoods
• Local convergence of the neighborhood-following algorithm for linear programming under degenerate cases
• Convergence of the BFGS-SQP Method for Degenerate Problems
• Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems

This page was built for publication: Quadratic convergence of potential-reduction methods for degenerate problems

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