AnO(nL) infeasible-interior-point algorithm for LCP with quadratic convergence
- 1 December 1996
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 62 (1) , 81-102
- https://doi.org/10.1007/bf02206812
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Polynomiality of infeasible-interior-point algorithms for linear programmingMathematical Programming, 1994
- An infeasible-interior-point algorithm for linear complementarity problemsMathematical Programming, 1994
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming AlgorithmMathematics of Operations Research, 1994
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity ProblemSIAM Journal on Optimization, 1994
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear ProgrammingMathematics of Operations Research, 1993
- A primal—dual infeasible-interior-point algorithm for linear programmingMathematical Programming, 1993
- A quadratically convergent O( $$\sqrt n $$ L)-iteration 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
- AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEMJournal of the Operations Research Society of Japan, 1990