Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


On the facet-to-facet property of solutions to convex parametric quadratic programs


J. Spjotvold, E.C. Kerrigan, C.N. Jones, P. Tondel, T. Johansen

Mathematical Theory of Networks and Systems, Kyoto, Japan

In some of the recently developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-facet property. It is shown by an example, whose solution is unique, that the facet-to-facet property does not hold in general. Consequently, some existing algorithms cannot guarantee that the entire parameter space will be explored. A simple modification, applicable to several existing algorithms, is presented for the purpose of overcoming this problem. Numerical results indicate that, compared to the original algorithms for parametric quadratic programs, the proposed method has lower computational complexity for problems whose solutions consist of a large number of critical regions.


Type of Publication:


File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@InProceedings { SpjEtal:2006:IFA_2696,
    author={J. Spjotvold and E.C. Kerrigan and C.N. Jones and P. Tondel and T.
    title={{On the facet-to-facet property of solutions to convex
	  parametric quadratic programs}},
    booktitle={Mathematical Theory of Networks and Systems},
    address={Kyoto, Japan},
Permanent link