The relation between the path of centers and Smale's regularization of the linear programming problem
DOI10.1016/0024-3795(91)90271-WzbMATH Open0727.65053OpenAlexW2047400365WikidataQ114852079 ScholiaQ114852079MaRDI QIDQ803732FDOQ803732
Authors: Nimrod Megiddo, Masakazu Kojima
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(91)90271-w
Recommendations
linear programminginterior point methodscomplementarity problempath of centersSmale's regularization
Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Complementary pivot theory of mathematical programming
- Title not available (Why is that?)
- A polynomial-time algorithm for a class of linear complementarity problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the existence and uniqueness of solutions in nonlinear complementarity theory
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- The Solution of Systems of Piecewise Linear Equations
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: The relation between the path of centers and Smale's regularization of the linear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803732)