On the convergence of the method of analytic centers when applied to convex quadratic programs
- 1 November 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 49 (1) , 341-358
- https://doi.org/10.1007/bf01588796
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programmingPublished by Springer Nature ,2006
- A new continuation method for complementarity problems with uniformP-functionsMathematical Programming, 1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- 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
- La mèthode des centres dans un espace topologiqueNumerische Mathematik, 1966
- Computational Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear ProgrammingManagement Science, 1964