On homogeneous and self-dual algorithms for LCP
- 1 January 1997
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 76 (1) , 211-221
- https://doi.org/10.1007/bf02614384
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A simplified homogeneous and self-dual linear programming algorithm and its implementationAnnals of Operations Research, 1996
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problemsApplied Mathematics & Optimization, 1996
- A quadratically convergent predictor—corrector method for solving linear programs from infeasible starting pointsMathematical Programming, 1994
- Local convergence of interior-point algorithms for degenerate monotone LCPComputational Optimization and Applications, 1994
- Some perturbation theory for linear programmingMathematical Programming, 1994
- Convergence behavior of interior-point algorithmsMathematical Programming, 1993
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality ProblemSIAM Journal on Optimization, 1992
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- Error bounds for monotone linear complementarity problemsMathematical Programming, 1986