## 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.

Année
2004
Publisher:
Cambridge, Cambridge University Engineering Dept
Laboratoires:

Notice créée le 2011-10-25, modifiée le 2019-03-16

Publisher's version:

PDF

Évaluer ce document:

1
2
3

(Pas encore évalué)