TY - RPRT
AB - 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.
T1 - Conjectures on an algorithm for convex parametric quadratic programs
DA - 2004
AU - Spjøtvold, J
AU - Kerrigan, E. C.
AU - Jones, Colin
AU - Johansen, T. A.
AU - Tøndel, P.
PB - Cambridge University Engineering Dept
PP - Cambridge
ID - 169766
UR - http://infoscience.epfl.ch/record/169766/files/cued_control_846.pdf
ER -