Mathematical Programming

, Volume 27, Issue 1, pp 1–33

A numerically stable dual method for solving strictly convex quadratic programs

  • D. Goldfarb
  • A. Idnani

DOI: 10.1007/BF02591962

Cite this article as:
Goldfarb, D. & Idnani, A. Mathematical Programming (1983) 27: 1. doi:10.1007/BF02591962


An efficient and numerically stable dual algorithm for positive definite quadratic programming is described which takes advantage of the fact that the unconstrained minimum of the objective function can be used as a starting point. Its implementation utilizes the Cholesky and QR factorizations and procedures for updating them. The performance of the dual algorithm is compared against that of primal algorithms when used to solve randomly generated test problems and quadratic programs generated in the course of solving nonlinear programming problems by a successive quadratic programming code (the principal motivation for the development of the algorithm). These computational results indicate that the dual algorithm is superior to primal algorithms when a primal feasible point is not readily available. The algorithm is also compared theoretically to the modified-simplex type dual methods of Lemke and Van de Panne and Whinston and it is illustrated by a numerical example.

Key words

Positive Definite Quadratic Programming Matrix Factorizations Dual Algorithms Successive Quadratic Programming Methods 

Copyright information

© The Mathematical Programming Society, Inc. 1983

Authors and Affiliations

  • D. Goldfarb
    • 1
  • A. Idnani
    • 2
  1. 1.Department of Industrial Engineering and Operations ResearchColumbia UniversityNew YorkUSA
  2. 2.Bell LaboratoiresMurray HillUSA

Personalised recommendations