Part of the Lecture Notes in Mathematics book series (LNM, volume 909)
Dual and primal-dual methods for solving strictly convex quadratic programs
KeywordsQuadratic Program Feasible Point Quadratic Program Problem Dual Method Dual Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Biggs, M. C. (1975) “Constrained minimization using recursive quadratic programming: some alternative subproblem formulations” in Towards global optimization, eds. L.C.W. Dixon and G.P. Szego, North-Holland Publishing Co. (Amsterdam).Google Scholar
- 2.Fletcher, R. (1970). “The Calculation of Feasible Points for Linearly Constrained Optimization Problems”, UKAFA Research Group Report, AERE R 6354 (Harwell).Google Scholar
- 3.Fletcher, R. (1970). “A FORTRAN Subroutine for Quadratic Programming”. UKAEA Research Group Report. AERE R 6370 (Harwell).Google Scholar
- 5.Goldfarb, D. (1972). “Extension of Newton's method and simplex methods for solving quadratic program”, in Numerical Methods for Nonlinear Optimization, ed. F. Lootsma, Academic Press (London), pp. 239–254.Google Scholar
- 6.Golfarb, D. and Idnani, A. U. (1981) “A numerically stable dual method for solving strictly convex quadratic programs”. The City College of New York, Department of Computer Sciences. Technical Report 81-102, (New York).Google Scholar
- 9.Idnani, A.U. (1980). “Numerically stable dual projection methods for solving positive definite quadratic programs” Ph.D. Thesis, The City College of New York, Department of Computer Sciences (New York).Google Scholar
- 10.Powell, M.J.D. (1978) “A fast algorithm for nonlinearly constrained optimization calculations” in Numerical Analysis, Dundee, 1977 Lecture Notes in Mathematics 630 (Springer Verlag, Berlin) pp. 144–157.Google Scholar
- 13.Rosen, J. B. and Suzuki, S. (1965) “Construction of nonlinear programming test problems”, Communications of the ACM pp. 113.Google Scholar
© Springer-Verlag 1982