A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings

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.

[1]  Michael Patriksson,et al.  Sensitivity Analysis of Aggregated Variational Inequality Problems, with Application to Traffic Equilibria , 2003, Transp. Sci..

[2]  T. Johansen,et al.  Further results on multiparametric quadratic programming , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[3]  O. Mangasarian.  A simple characterization of solution sets of convex programs , 1988 .

[4]  Donald Goldfarb,et al.  A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..

[5]  Manfred Morari,et al.  Multiparametric Linear Programming with Applications to Control , 2007, Eur. J. Control.

[6]  J. Maciejowski,et al.  Soft constraints and exact penalty functions in model predictive control , 2000 .

[7]  ADAM B. LEVY.  Solution Sensitivity from General Principles , 2001, SIAM J. Control. Optim..

[8]  Stephan Dempe,et al.  Directional derivatives of the solution of a parametric nonlinear program , 1995, Math. Program..

[9]  Dimitri P. Bertsekas,et al.  Convex Analysis and Optimization , 2003 .

[10]  Yinyu Ye,et al.  Convergence behavior of interior-point algorithms , 1993, Math. Program..

[11]  Guy P. Nason,et al.  CRM Proceedings and Lecture Notes , 1998 .

[12]  T. Johansen.  On multi-parametric nonlinear programming and explicit nonlinear model predictive control , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[13]  Komei Fukuda,et al.  An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices , 2008, 0807.2318.

[14]  Tor Arne Johansen,et al.  Continuous Selection and Unique Polyhedral Representation of Solutions to Convex Parametric Quadratic Programs , 2007 .

[15]  R. Rockafellar,et al.  Variational conditions and the proto-differentiation of partial subgradient mappings , 1996 .

[16]  D. Du,et al.  Recent Advances in Nonsmooth Optimization , 1995 .

[17]  B. Bank,et al.  Non-Linear Parametric Optimization , 1983 .

[18]  Eric C. Kerrigan,et al.  Conjectures on an algorithm for convex parametric quadratic programs , 2004 .

[19]  Colin Neil Jones,et al.  On the facet-to-facet property of solutions to convex parametric quadratic programs , 2006, Autom..

[20]  S. M. Robinson.  Some continuity properties of polyhedral multifunctions , 1981 .

[21]  M. Morari,et al.  Parametric Analysis of Controllers for Constrained Linear Systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[22]  Alberto Bemporad,et al.  An algorithm for multi-parametric quadratic programming and explicit MPC solutions , 2003, Autom..

[23]  Alberto Bemporad,et al.  Model predictive control based on linear programming - the explicit solution , 2002, IEEE Transactions on Automatic Control.

[24]  R. Tyrrell Rockafellar,et al.  Ample Parameterization of Variational Inclusions , 2001, SIAM J. Optim..

[25]  M. Morari,et al.  A geometric algorithm for multi-parametric linear programming , 2003 .

[26]  M. Morari,et al.  Geometric Algorithm for Multiparametric Linear Programming , 2003 .

[27]  Colin Neil Jones,et al.  Primal-Dual Enumeration for Multiparametric Linear Programming , 2006, ICMS.

[28]  Colin Neil Jones,et al.  Lexicographic perturbation for multiparametric linear programming with applications to control , 2007, Autom..

[29]  O. Mangasarian,et al.  Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems , 1987 .

[30]  J.M. Maciejowski,et al.  Reverse Search for Parametric Linear Programming , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[31]  Asen L. Dontchev,et al.  Primal-Dual Solution Perturbations in Convex Optimization , 2001 .

[32]  B. Eaves.  On Quadratic Programming , 1971 .

[33]  Diethard Klatte,et al.  Nonsmooth Equations in Optimization: "Regularity, Calculus, Methods And Applications" , 2006 .

[34]  R. Rockafellar,et al.  Sensitivity analysis of solutions to generalized equations , 1994 .

[35]  Alberto Bemporad,et al.  A survey on explicit model predictive control , 2009 .

[36]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[37]  Alberto Bemporad,et al.  The explicit linear quadratic regulator for constrained systems , 2003, Autom..

[38]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[39]  Adam B. Levy,et al.  Sensitivity of Solutions in Nonlinear Programming Problems with Nonunique Multipliers , 1995 .

[40]  M. Morari,et al.  On-line Tuning of Controllers for Systems with Constraints , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[41]  Alberto Bemporad,et al.  Multiobjective model predictive control , 2009, Autom..

[42]  Colin N. Jones,et al.  Polyhedral Tools for Control , 2005 .