1.Previous
3.Next

are the next-simplest. In QP, the constraints are all linear, but the objective may be a convex quadratic function.
*Second order cone programming are more general.
*Semidefinite programming are more general.
*Conic optimization are even more general - see figure to the right,Other special cases include;
*Least squares
*Quadratic minimization with convex quadratic constraints

1.Previous
3.Next