Exploiting convexity in direct Optimal Control: a sequential convex quadratic programming method

Direct optimal control methods first discretize a continuous-time Optimal Control Problem (OCP) and then solve the resulting Nonlinear Program (NLP). Sequential Quadratic Programming (SQP) is a popular family of algorithms to solve this finite dimensional optimization problem. In the specific case of a least squares cost, the Generalized Gauss-Newton (GGN) method is a popular approach which works very well under some assumptions. This paper proposes a Sequential Convex Quadratic Programming (SCQP) scheme which exploits additional convexities in the NLP in order to generalize the GGN algorithm, possibly extend its applicability and improve its local convergence. These properties are studied in detail for the proposed SCQP algorithm, which will be compared to the classical GGN method using a numerical case study of the optimal control of an inverted pendulum.

[1]  H. Bock,et al.  Recent Advances in Parameteridentification Techniques for O.D.E. , 1983 .

[2]  M. Diehl,et al.  Real-time optimization and nonlinear model predictive control of processes governed by differential-algebraic equations , 2000 .

[3]  Moritz Diehl,et al.  Real-Time Optimization for Large Scale Nonlinear Processes , 2001 .

[4]  Yurii Nesterov,et al.  Cubic regularization of Newton method and its global performance , 2006, Math. Program..

[5]  Marko Bacic,et al.  Model predictive control , 2003 .

[6]  H. Bock,et al.  A Multiple Shooting Algorithm for Direct Solution of Optimal Control Problems , 1984 .

[7]  James B. Rawlings,et al.  Model Predictive Control , 2012 .

[8]  Moritz Diehl,et al.  CasADi -- A symbolic package for automatic differentiation and optimal control , 2012 .

[9]  Andrea Walther,et al.  An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization , 2010, Optim. Methods Softw..

[10]  Moritz Diehl,et al.  Local Convergence of Sequential Convex Programming for Nonconvex Optimization , 2010 .

[11]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

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

[13]  J. Nocedal,et al.  A sequential quadratic programming algorithm with an additional equality constrained phase , 2012 .

[14]  Ilya Sutskever,et al.  Learning Recurrent Neural Networks with Hessian-Free Optimization , 2011, ICML.

[15]  Dinh Quoc Tran,et al.  Adjoint-Based Predictor-Corrector Sequential Convex Programming for Parametric Nonlinear Optimization , 2012, SIAM J. Optim..

[16]  Christian Kirches,et al.  qpOASES: a parametric active-set algorithm for quadratic programming , 2014, Mathematical Programming Computation.