%T A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings
%P 1405-1418
%I Elsevier 
%V 46
%K Parametric optimization; Algorithms and software; Control of constrained systems
%A Panagiotis Patrinos
%A Haralambos Sarimveis
%X In this paper we derive formulas for computing graphical derivatives of the (possibly multivalued) solution mapping for convex parametric quadratic programs. Parametric programming has recently received much attention in the control community, however most algorithms are based on the restrictive assumption that the so called critical regions of the solution form a polyhedral subdivision, i.e. the intersection of two critical regions is either empty or a face of both regions. Based on the theoretical results of this paper, we relax this assumption and show how we can efficiently compute all adjacent full dimensional critical regions along a facet of an already discovered critical region. Coupling the proposed approach with the graph traversal paradigm, we obtain very efficient algorithms for the solution of parametric convex quadratic programs
%L eprints1023
%D 2010
%R 10.1016/j.automatica.2010.06.008
%N 9
%J Automatica