A weighted gram-schmidt method for convex quadratic programming
- 1 October 1984
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 30 (2) , 176-195
- https://doi.org/10.1007/bf02591884
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A numerically stable dual method for solving strictly convex quadratic programsMathematical Programming, 1983
- Range-Space Methods for Convex Quadratic Programming.Published by Defense Technical Information Center (DTIC) ,1982
- On the Convergence of a Sequential Quadratic Programming Method with an Augmented Lagrangian Line Search Functions.Published by Defense Technical Information Center (DTIC) ,1982
- A computational method for the indefinite quadratic programming problemLinear Algebra and its Applications, 1980
- Numerically stable methods for quadratic programmingMathematical Programming, 1978
- Matrix factorizations in optimization of nonlinear functions subject to linear constraintsMathematical Programming, 1976
- Methods for modifying matrix factorizationsMathematics of Computation, 1974
- A General Quadratic Programming AlgorithmIMA Journal of Applied Mathematics, 1971
- Numerical Techniques in Mathematical ProgrammingPublished by Elsevier ,1970