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.


    • EPFL-REPORT-169766

    Record created on 2011-10-25, modified on 2017-05-10

Related material