Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming

DOI10.1007/BF01581140zbMath0811.90068OpenAlexW2013986021WikidataQ60140227 ScholiaQ60140227MaRDI QIDQ1338138

Irvin J. Lustig, David F. Shanno, Roy E. Marsten

Publication date: 9 May 1995

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

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

zbMATH Keywords

primal-dual algorithmlogarithmic barrier methodspredictor-corrector extension

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

An infeasible-interior-point algorithm for linear complementarity problems, Primal-dual nonlinear rescaling method for convex optimization, A Newton's method for perturbed second-order cone programs, Presolving in linear programming, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence, A simplified homogeneous and self-dual linear programming algorithm and its implementation, A lower bound on the number of iterations of long-step primal-dual linear programming algorithms, Complexity analysis of a full-{N}ewton step interior-point method for linear optimization, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points, Warm start of the primal-dual method applied in the cutting-plane scheme, Steplengths in interior-point algorithms of quadratic programming

Cites Work

• Unnamed Item
• Unnamed Item
• Computational experience with a primal-dual interior point method for linear programming
• A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
• A primal-dual infeasible-interior-point algorithm for linear programming
• On the Implementation of a Primal-Dual Interior Point Method
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives