A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- 1 March 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 36 (1) , 45-72
- https://doi.org/10.1137/1036003
Abstract
No abstract availableThis publication has 31 references indexed in Scilit:
- A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear ProgrammingSIAM Journal on Optimization, 1993
- A build-up variant of the logarithmic barrier method for LPOperations Research Letters, 1992
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear ProgrammingSIAM Journal on Optimization, 1992
- Path-Following Methods for Linear ProgrammingSIAM Review, 1992
- An optimal-basis identification technique for interior-point linear programming algorithmsLinear Algebra and its Applications, 1991
- On finding a vertex solution using interior point methodsLinear Algebra and its Applications, 1991
- Computational experience with a primal-dual interior point method for linear programmingLinear Algebra and its Applications, 1991
- Dual ellipsoids and degeneracy in the projective algorithm for linear programmingContemporary Mathematics, 1990
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithmAlgorithmica, 1986
- An analogue of Moreau’s proximation theorem, with application to the nonlinear complementarity problemPacific Journal of Mathematics, 1980