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.
KeywordsQuadratic Programming Linear Programming Problem Linear Complementarity Problem Quadratic Programming Problem Central Path
Unable to display preview. Download preview PDF.
- 1.G. H. Golub and C. F. Van Loan, Matrix Computation, 2nd ed., Baltimore, Johns Hopkins University Press, MD, 1989.Google Scholar
- 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