A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
- 1 May 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 7 (2) , 304-317
- https://doi.org/10.1137/s1052623494267826
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A path-following interior-point algorithm for linear and quadratic problemsAnnals of Operations Research, 1996
- AnO(nL) infeasible-interior-point algorithm for LCP with quadratic convergenceAnnals of Operations Research, 1996
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear ProgrammingSIAM Journal on Optimization, 1995
- Polynomiality of infeasible-interior-point algorithms for linear programmingMathematical Programming, 1994
- An infeasible-interior-point algorithm for linear complementarity problemsMathematical Programming, 1994
- Computational experience with a globally convergent primal—dual predictor—corrector algorithm for linear programmingMathematical Programming, 1994
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity ProblemSIAM Journal on Optimization, 1994
- A primal—dual infeasible-interior-point algorithm for linear programmingMathematical Programming, 1993
- On quadratic and $$O\left( {\sqrt {nL} } \right)$$ convergence of a predictor—corrector algorithm for LCPMathematical Programming, 1993
- A path-following infeasible-interior-point algorithm for linear complementarity problemsOptimization Methods and Software, 1993