Adjoint estimation using direct transcription multipliers: compressed trapezoidal method

Direct transcription methods for the numerical solution of optimal control problems have the advantage that they do not require estimates of the adjoint variables. However, it is natural to want to use the discrete NLP multipliers to estimate the adjoint variables. It has been shown earlier in the literature for a large collection of numerical discretizations that order of the state and control variables found are generally independent of the implementation of the chosen discretization if no post processing is used to find the control. This is not always true for the adjoint estimation problem. The compressed trapezoidal discretization is used in some commercial codes. In this paper we show that the second order adjoint estimate result for the uncompressed trapezoidal method does not hold for the compressed trapezoidal method. We also show how to recover the lost order and carefully analyze convergence. Some related results are also discussed.

[1]  Ernst Hairer,et al.  Solving Ordinary Differential Equations I: Nonstiff Problems , 2009 .

[2]  E. Hairer,et al.  Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems , 2010 .

[3]  H. Maurer,et al.  Differential stability in infinite-dimensional nonlinear programming , 1980 .

[4]  E. Hairer,et al.  Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems , 1993 .

[5]  W. Hager.  Rates of Convergence for Discrete Approximations to Unconstrained Control Problems , 1976 .

[6]  Helmut Maurer,et al.  Sensitivity analysis for parametric control problems with control-state constraints , 1996, Comput. Optim. Appl..

[7]  M. Alber,et al.  Tools for the analysis of dose optimization: II. Sensitivity analysis , 2002, Physics in medicine and biology.

[8]  Anna Engelsone,et al.  Direct Transcription Methods in Optimal Control: Theory and Practice , 2006 .

[9]  W. Hager,et al.  Optimality, stability, and convergence in nonlinear control , 1995 .

[10]  Anil V. Rao,et al.  Practical Methods for Optimal Control Using Nonlinear Programming , 1987 .

[11]  William W. Hager,et al.  Runge-Kutta methods in optimal control and the transformed adjoint system , 2000, Numerische Mathematik.

[12]  A. Engelsone,et al.  Order of Convergence in the Direct Transcription Solution of Optimal Control Problems , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[13]  William W. Hager,et al.  Second-Order Runge-Kutta Approximations in Control Constrained Optimal Control , 2000, SIAM J. Numer. Anal..

[14]  O. V. Stryk,et al.  Numerical Solution of Optimal Control Problems by Direct Collocation , 1993 .

[15]  I. Michael Ross,et al.  Costate Estimation by a Legendre Pseudospectral Method , 1998 .

[16]  Jane J. Ye,et al.  Sensitivity Analysis of the Value Function for Optimization Problems with Variational Inequality Constraints , 2001, SIAM J. Control. Optim..