A convergence analysis for a convex version of Dikin's algorithm
Author:
- 1 December 1996
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 62 (1) , 357-374
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A simplified global convergence proof of the affine scaling algorithmAnnals of Operations Research, 1993
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptionsMathematical Programming, 1993
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming ProblemsMathematics of Operations Research, 1992
- On the convergence of the affine-scaling algorithmMathematical Programming, 1992
- On affine scaling algorithms for nonconvex quadratic programmingMathematical Programming, 1992
- An interior point algorithm of $O(\sqrt m \left| {\ln \varepsilon } \right|)$ iterations forC 1-convex programmingMathematical Programming, 1992
- Some results concerning convergence of the affine scaling algorithm1990
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 1986
- Convex Analysis1970