Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming

DOI10.1016/j.apnum.2008.05.006zbMath1163.90042OpenAlexW2021328462MaRDI QIDQ1012253

Coralia Cartis

Publication date: 15 April 2009

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2008.05.006

zbMATH Keywords

linear programminginterior point methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Interior-point methods (90C51)

Related Items

An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem, A polynomial arc-search interior-point algorithm for linear programming, An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints, A new second-order corrector interior-point algorithm for semidefinite programming, A constraint-reduced variant of Mehrotra's predictor-corrector algorithm, An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming, Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming, Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem, A predictor-corrector algorithm for linear optimization based on a modified Newton direction, Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming, An interior-point algorithm for linear programming with optimal selection of centering parameter and step size, Further development of multiple centrality correctors for interior point methods

Uses Software

• LIPSOL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
• On finding a vertex solution using interior point methods
• A primal-dual infeasible-interior-point algorithm for linear programming
• Interior-point methods
• Multiple centrality corrections in a primal-dual method for linear programming
• On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• On the Implementation of a Primal-Dual Interior Point Method
• Path-Following Methods for Linear Programming
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• Numerical Optimization
• User'S guide To Lipsol linear-programming interior point solvers V0.4
• The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
• An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods