A new simple homotopy algorithm for linear programming. I

DOI10.1016/0885-064X(88)90025-8zbMath0643.90052OpenAlexW2004677991WikidataQ60781614 ScholiaQ60781614MaRDI QIDQ1102185

Lenore Blum

Publication date: 1988

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(88)90025-8

zbMATH Keywords

homotopy algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (1)

A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints

Cites Work

• Towards an asymptotic analysis of Karmarkar's algorithm
• Homotopy techniques in linear programming
• On the average number of steps of the simplex method of linear programming
• Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average
• The Solution of Systems of Piecewise Linear Equations
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new simple homotopy algorithm for linear programming. I