Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs

ABSTRACT Local sensitivity information is obtained for KKT points of parametric NLPs that may exhibit active set changes under parametric perturbations; under appropriate regularity conditions, computationally relevant generalized derivatives of primal and dual variable solutions of parametric NLPs are calculated. Ralph and Dempe obtained directional derivatives of solutions of parametric NLPs exhibiting active set changes from the unique solution of an auxiliary quadratic program. This article uses lexicographic directional derivatives, a newly developed tool in nonsmooth analysis, to generalize the classical NLP sensitivity analysis theory of Ralph and Dempe. By viewing said auxiliary quadratic program as a parametric NLP, the results of Ralph and Dempe are applied to furnish a sequence of coupled QPs, whose unique solutions yield generalized derivative information for the NLP. A practically implementable algorithm is provided. The theory developed here is motivated by widespread applications of nonlinear programming sensitivity analysis, such as in dynamic control and optimization problems.

[1]  Kamil A. Khan,et al.  Computationally relevant generalized derivatives: theory, evaluation and applications , 2018, Optim. Methods Softw..

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

[3]  Paul I. Barton,et al.  Generalized Sensitivity Analysis of Nonlinear Programs , 2018, SIAM J. Optim..

[4]  L. Biegler,et al.  Nested direct transcription optimization for singular optimal control problems , 2016 .

[5]  Wolfgang Marquardt,et al.  Fast NMPC schemes for regulatory and economic NMPC – A review ☆ , 2016 .

[6]  Paul I. Barton,et al.  A vector forward mode of automatic differentiation for generalized derivative evaluation , 2015, Optim. Methods Softw..

[7]  Paul I. Barton,et al.  Generalized Derivatives for Solutions of Parametric Ordinary Differential Equations with Non-differentiable Right-Hand Sides , 2014, J. Optim. Theory Appl..

[8]  Zhijiang Shao,et al.  A bilevel NLP sensitivity‐based decomposition for dynamic optimization with moving finite elements , 2014 .

[9]  Andreas Griewank,et al.  On stable piecewise linearization and generalized algorithmic differentiation , 2013, Optim. Methods Softw..

[10]  Francisco Facchinei,et al.  An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions , 2013, Mathematical Programming.

[11]  S. Scholtes.  Introduction to Piecewise Differentiable Equations , 2012 .

[12]  Michael Ulbrich,et al.  Semismooth Newton Methods for Variational Inequalities and Constrained Optimization Problems in Function Spaces , 2011, MOS-SIAM Series on Optimization.

[13]  Jay H. Lee,et al.  Model predictive control: Review of the three decades of development , 2011 .

[14]  Stephen P. Boyd,et al.  Fast Model Predictive Control Using Online Optimization , 2010, IEEE Transactions on Control Systems Technology.

[15]  B. T. Baumrucker,et al.  MPEC strategies for optimization of a class of hybrid dynamic systems , 2009 .

[16]  Yurii Nesterov,et al.  Lexicographic differentiation of nonsmooth functions , 2005, Math. Program..

[17]  Lorenz T. Biegler,et al.  An MPEC formulation for dynamic optimization of distillation operations , 2004, Comput. Chem. Eng..

[18]  Jan Vlcek,et al.  Algorithm 811: NDA: algorithms for nondifferentiable optimization , 2001, TOMS.

[19]  J. Frédéric Bonnans,et al.  Perturbation Analysis of Optimization Problems , 2000, Springer Series in Operations Research.

[20]  Jan Vlcek,et al.  A bundle-Newton method for nonsmooth unconstrained minimization , 1998, Math. Program..

[21]  Jong-Shi Pang,et al.  Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps , 1996, Math. Oper. Res..

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

[23]  B. Mordukhovich.  Generalized Differential Calculus for Nonsmooth and Set-Valued Mappings , 1994 .

[24]  Dick den Hertog,et al.  Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity , 1994 .

[25]  Stephan Dempe,et al.  Directional differentiability of optimal solutions under Slater's condition , 1993, Math. Program..

[26]  Liqun Qi,et al.  A nonsmooth version of Newton's method , 1993, Math. Program..

[27]  Jerzy Kyparisis,et al.  Sensitivity Analysis for Nonlinear Programs and Variational Inequalities with Nonunique Multipliers , 1990, Math. Oper. Res..

[28]  Yinyu Ye,et al.  An extension of Karmarkar's projective algorithm for convex quadratic programming , 1989, Math. Program..

[29]  A. Shapiro.  Sensitivity analysis of nonlinear programs and differentiability properties of metric projections , 1988 .

[30]  K. Kiwiel.  Methods of Descent for Nondifferentiable Optimization , 1985 .

[31]  Jacques Gauvin,et al.  A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming , 1977, Math. Program..

[32]  B. Mordukhovich.  Variational analysis and generalized differentiation , 2006 .

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

[34]  David Q. Mayne,et al.  Constrained model predictive control: Stability and optimality , 2000, Autom..

[35]  M. Kojima,et al.  EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS , 1986 .

[36]  R. Janin.  Directional derivative of the marginal function in nonlinear programming , 1984 .

[37]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[38]  C. Lemaréchal,et al.  ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION , 1981 .

[39]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .