A Long-step barrier method for convex quadratic programming
- 1 November 1993
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 10 (5) , 365-382
- https://doi.org/10.1007/bf01769704
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear ProgrammingSIAM Journal on Optimization, 1992
- A Large-Step Analytic Center Method for a Class of Smooth Convex Programming ProblemsSIAM Journal on Optimization, 1992
- Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function MethodSIAM Journal on Optimization, 1991
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- On computing the center of a convex quadratically constrained setMathematical Programming, 1991
- On the convergence of the method of analytic centers when applied to convex quadratic programsMathematical Programming, 1990
- An O(n 3 L) primal interior point algorithm for convex quadratic programmingMathematical Programming, 1990
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- Fast algorithms for convex quadratic programming and multicommodity flowsPublished by Association for Computing Machinery (ACM) ,1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984