A numerical study of an infeasible primal-dual path-following algorithm for linear programming

DOI10.1016/j.amc.2006.07.135zbMath1117.65082OpenAlexW2005675855MaRDI QIDQ884611

N. E. Zubov

Publication date: 6 June 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.07.135

zbMATH Keywords

algorithmlinear programmingcomparison of methodsnumerical examplesKarmarkar algorithminfeasible primal-dual path-following methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (2)

An interior-point algorithm for semidefinite least-squares problems. ⋮ Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems

Cites Work

• Interior path following primal-dual algorithms. I: Linear programming
• Superlinear convergence of infeasible-interior-point methods for linear programming
• Path-Following Methods for Linear Programming
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A numerical study of an infeasible primal-dual path-following algorithm for linear programming