On quadratic and $$O\left( {\sqrt {nL} } \right)$$ convergence of a predictor—corrector algorithm for LCP
- 1 February 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 62 (1) , 537-551
- https://doi.org/10.1007/bf01585182
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Convergence behavior of interior-point algorithmsMathematical Programming, 1993
- Theoretical convergence of large-step primal—dual interior point algorithms for linear programmingMathematical Programming, 1993
- An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear ProgrammingSIAM Journal on Optimization, 1992
- An Interior-point Method with Polynomial Complexity and Superlinear Convergence for Linear Complementarity ProblemsPublished by Defense Technical Information Center (DTIC) ,1991
- Karmarkar's linear programming algorithm and Newton's methodMathematical Programming, 1991
- Limiting behavior of the affine scaling continuous trajectories for linear programming problemsContemporary Mathematics, 1990
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A multiplicative barrier function method for linear programmingAlgorithmica, 1986
- A polynomial newton method for linear programmingAlgorithmica, 1986
- On approximate solutions of systems of linear inequalitiesJournal of Research of the National Bureau of Standards, 1952