Loading...
report
Conjectures on an algorithm for convex parametric quadratic programs
2004
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.
Loading...
Name
cued_control_846.pdf
Type
Publisher's version
Access type
openaccess
Size
184.58 KB
Format
Adobe PDF
Checksum (MD5)
3a09017493ccd39bd9d186faea7ae6d0