A path-following interior-point algorithm for linear and quadratic problems
- 1 December 1996
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 62 (1) , 103-130
- https://doi.org/10.1007/bf02206813
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Generalized Linear Complementarity ProblemsMathematics of Operations Research, 1995
- An infeasible-interior-point algorithm for linear complementarity problemsMathematical Programming, 1994
- Local convergence of interior-point algorithms for degenerate monotone LCPComputational Optimization and Applications, 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 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
- Error bounds for nondegenerate monotone linear complementarity problemsMathematical Programming, 1990
- Monotone (nonlinear) operators in Hilbert spaceDuke Mathematical Journal, 1962