Conjectures on an algorithm for convex parametric quadratic programs

An algorithm for convex parametric QPs is studied. The algorithm explores the parameter space by stepping a sufficiently small distance over the facets of each critical region and thereby identifying the neighboring regions. Some conjectures concerning this algorithm and the structure of the solution of a parametric QP are presented.


Year:
2004
Publisher:
Cambridge, Cambridge University Engineering Dept
Laboratories:




 Record created 2011-10-25, last modified 2018-01-28

External link:
Download fulltext
Publisher's version
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)