The relation between the path of centers and Smale's regularization of the linear programming problem
From MaRDI portal
Publication:803732
DOI10.1016/0024-3795(91)90271-WzbMath0727.65053OpenAlexW2047400365WikidataQ114852079 ScholiaQ114852079MaRDI QIDQ803732
Nimrod Megiddo, Kojima, Masakazu
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
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)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- Complementary pivot theory of mathematical programming
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- The Solution of Systems of Piecewise Linear Equations
- On the existence and uniqueness of solutions in nonlinear complementarity theory