The Homotopy Principle and Algorithms for Linear Programming

DOI10.1137/0801021zbMath0757.90053OpenAlexW2069258240MaRDI QIDQ4012412

John Lawrence Nazareth

Publication date: 27 September 1992

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0801021

zbMATH Keywords

Newton's methodinterior-point methodsself-dualcomplexity analysisprimal-dualpath-followinghomotopy principleprediction-corrector

Mathematics Subject Classification ID

Linear programming (90C05) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Related Items

MIPping closures: An instant survey, A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints, The implementation of linear programming algorithms based on homotopies, Deriving potential functions via a symmetry principle for nonlinear equations, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations, A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems, Parametric mixed-integer 0-1 linear programming: The general case for a single parameter, Optimizing over the split closure