A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP
- 1 February 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 6 (1) , 1-18
- https://doi.org/10.1137/0806001
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- 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
- A quadratically convergent predictor—corrector method for solving linear programs from infeasible starting pointsMathematical Programming, 1994
- An infeasible-interior-point algorithm for linear complementarity problemsMathematical Programming, 1994
- Superlinear convergence of infeasible-interior-point methods for linear programmingMathematical Programming, 1994
- Local convergence of interior-point algorithms for degenerate monotone LCPComputational Optimization and Applications, 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