A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
- 1 April 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 28 (2) , 529-544
- https://doi.org/10.1137/0728029
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- On the convergence of the method of analytic centers when applied to convex quadratic programsMathematical Programming, 1990
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic OperationsMathematics of Operations Research, 1990
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- An Algorithm for Solving Linear Programming Problems in O(n 3 L) OperationsPublished by Springer Nature ,1989
- Controlled perturbations for quadratically constrained quadratic programsMathematical Programming, 1986
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Sparse Matrix Methods in OptimizationSIAM Journal on Scientific and Statistical Computing, 1984
- A Dual Method for Quadratic Programs with Quadratic ConstraintsSIAM Journal on Applied Mathematics, 1975
- Quadratic programming with quadratic constraintsNaval Research Logistics Quarterly, 1972