Superlinear convergence of infeasible-interior-point methods for linear programming

DOI10.1007/BF01581155zbMath0820.90072OpenAlexW2083305491MaRDI QIDQ1337141

Detong Zhang, Yin Zhang

Publication date: 26 September 1995

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

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

zbMATH Keywords

interior-point methods\(Q\)-superlinear convergencelocal convergence propertiesprimal-dual infeasible-interior-point framework

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

An infeasible-interior-point algorithm for linear complementarity problems, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution, An infeasible-interior-point algorithm using projections onto a convex set, A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence, A numerical study of an infeasible primal-dual path-following algorithm for linear programming, Optimized choice of parameters in interior-point methods for linear programming, A Mehrotra type predictor-corrector interior-point algorithm for linear programming, Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions, On the convergence of a predictor-corrector variant algorithm

Cites Work

• Unnamed Item
• Error bounds for nondegenerate monotone linear complementarity problems
• Computational experience with a primal-dual interior point method for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
• On the Implementation of a Primal-Dual Interior Point Method
• On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
• On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems