Approximate Gradient Projection Method with Runge-Kutta Schemes for Optimal Control Problems

We consider an optimal control problem for systems governed by ordinary differential equations with control constraints. The state equation is discretized by the explicit fourth order Runge-Kutta scheme and the controls are approximated by discontinuous piecewise affine ones. We then propose an approximate gradient projection method that generates sequences of discrete controls and progressively refines the discretization during the iterations. Instead of using the exact discrete directional derivative, which is difficult to calculate, we use an approximate derivative of the cost functional defined by discretizing the continuous adjoint equation by the same Runge-Kutta scheme and the integral involved by Simpson's integration rule, both involving intermediate approximations. The main result is that accumulation points, if they exist, of sequences constructed by this method satisfy the weak necessary conditions for optimality for the continuous problem. Finally, numerical examples are given.     

Mixed Frank–Wolfe Penalty Method with Applications to Nonconvex Optimal Control Problems

We consider a general optimization problem which is an abstract formulation of a broad class of state-constrained optimal control problems in relaxed form. We describe a generalized mixed Frank–Wolfe penalty method for solving the problem and prove that, under appropriate assumptions, accumulation points of sequences constructed by this method satisfy the necessary conditions for optimality. The method is then applied to relaxed optimal control problems involving lumped as well as distributed parameter systems. Numerical examples are given.