Quadratic and Convex Programming


Quadratic programming (QP) is a family of methods, techniques, and algorithms that can be used to minimize quadratic objective functions subject to linear constraints. On the one hand, QP shares many combinatorial features with linear programming (LP) and, on the other, it is often used as the basis of constrained nonlinear programming. In fact, the computational efficiency of a nonlinear programming algorithm is often heavily dependent on the efficiency of the QP algorithm involved.


Quadratic Programming Linear Programming Problem Linear Complementarity Problem Quadratic Programming Problem Central Path 
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.
    G. H. Golub and C. F. Van Loan, Matrix Computation, 2nd ed., Baltimore, Johns Hopkins University Press, MD, 1989.Google Scholar
  2. 2.
    R. Fletcher, Practical Methods of Optimization, 2nd ed., Wiley, NY, 1987.MATHGoogle Scholar
  3. 3.
    P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization, Academic Press, NY, 1981.MATHGoogle Scholar
  4. 4.
    D. Goldfarb and A. Idnani, “A numerically stable dual method for solving strictly convex quadratic programs,” Math. Prog., vol. 27, pp. 1–33, 1983.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    C. L. Lawson and R. J. Hanson, Solving Least Squares Problems, Prentice Hall, Englewood Cliffs, NJ, 1974.MATHGoogle Scholar
  6. 6.
    R. D. C. Monteiro and I. Adler, “Interior path following primal-dual algorithms, Part II: Convex quadratic programming,” Math. Programming, vol. 44, pp. 45–66, 1989.Google Scholar
  7. 7.
    R. D. C. Monteiro and I. Adler, “Interior path following primal-dual algorithms, Part I: Linear programming,” Math. Programming, vol. 44, pp. 27–41, 1989.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    S. J. Wright, Primal-Dual Interior-Point Methods, SIAM, Philadelphia, PA, 1997.MATHGoogle Scholar
  9. 9.
    Y. Ye, Interior Point Algorithms: Theory and Analysis, Wiley, NY, 1997.MATHGoogle Scholar
  10. 10.
    S. P. Boyd and C. H. Barratt, Linear Controller Design: Limits of Performance, Prentice Hall, Englewood Cliffs, NJ, 1991.MATHGoogle Scholar
  11. 11.
    J. E. Kelley, “The cutting-plane method for solving convex programs,” J. SIAM, vol. 8, pp. 703–712, Dec. 1960.MathSciNetGoogle Scholar
  12. 12.
    R. T. Rockafellar, Convex Analysis, 2nd ed., Princeton University Press, Princeton, NJ., 1970.MATHGoogle Scholar
  13. 13.
    L. G. Khachiyan, “A polynomial algorithm in linear programming,” Soviet Math. Doklady, vol. 20, pp. 191–194, 1979.MATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Personalised recommendations