Dual and primal-dual methods for solving strictly convex quadratic programs

  • D. Goldfarb
  • A. Idnani
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 909)


Quadratic 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.

Unable to display preview. Download preview PDF.


  1. 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. 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. 3.
    Fletcher, R. (1970). “A FORTRAN Subroutine for Quadratic Programming”. UKAEA Research Group Report. AERE R 6370 (Harwell).Google Scholar
  4. 4.
    Fletcher, R. (1971). “A general quadratic programming algorithm” Journal Inst. Math. Applics, Vol. 7, pp. 76–91.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 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. 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
  7. 7.
    Han, S-P (1976) “Superlinearly convergent variable metric algorithms for general nonlinear programming problems”, Mathematical Programming, Vol. 11, pp. 263–282.MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Han, S-P (1977) “A globally convergent method for nonlinear programming”, Journal of Optimization Theory and Applications, Vol. 22, pp. 297–309.MathSciNetCrossRefzbMATHGoogle Scholar
  9. 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. 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
  11. 11.
    Powell, M.J.D., (1980), “An example of cycling in a feasible point algorithm”, Report 1980/NA5 DAMTP, University of Cambridge, Cambridge, England).zbMATHGoogle Scholar
  12. 12.
    Rosen, J.B. (1960) “The gradient projection method for nonlinear programming, Part 1. Linear constraints”, SIAM Journal of Applied Math. Vol. 8, pp. 181–217.CrossRefzbMATHGoogle Scholar
  13. 13.
    Rosen, J. B. and Suzuki, S. (1965) “Construction of nonlinear programming test problems”, Communications of the ACM pp. 113.Google Scholar

Copyright information

© Springer-Verlag 1982

Authors and Affiliations

  • D. Goldfarb
    • 1
  • A. Idnani
    • 2
  1. 1.The City College of New YorkCUNYNew York
  2. 2.Bell LaboratoriesMurray Hill

Personalised recommendations