The method differs from general convex programming methods by terminating in a finite number of iterations and is actually an application of the Simplex and dual methods for quadratic programming to ...

Example 8.10: Quadratic Programming The quadratic program can be solved by solving an equivalent linear complementarity problem when H is positive semidefinite. The approach is outlined in the ...