On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming

DOI10.1287/moor.17.1.225zbMath0793.90032OpenAlexW2058692899MaRDI QIDQ4016719

Renato D. C. Monteiro

Publication date: 16 January 1993

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.17.1.225

zbMATH Keywords

polynomial algorithminterior point algorithmspotential functionKarmarkar's algorithmcontinuous trajectoriesfamily of vector fieldspotential reduction algorithmslimiting behavior of the trajectories

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Analysis of some interior point continuous trajectories for convex programming, Degeneracy in interior point methods for linear programming: A survey, An interior point parameterized central path following algorithm for linearly constrained convex programming