A Posteriori Error Estimates of Mixed Methods for Parabolic Optimal Control Problems

Error estimates of fully discrete mixed finite element methods for semilinear quadratic parabolic optimal control problem

We derive local error estimates for the discretization of optimal control problems governed by linear advection-diffusion partial differential equations (PDEs) using the streamline upwind/Petrov Galerkin (SUPG) stabilized finite element method. We show that if the SUPG method is used to solve optimization problems governed by an advection-dominated PDE, the convergence properties of the SUPG method is substantially different from the convergence properties of the SUPG method applied for the solution of an advection-dominated PDE. The reason is that the solution of the optimal control problem involves another advection-dominated PDE, the so-called adjoint equation, whose advection field is just the negative of the advection of the governing PDEs. For the solution of the optimal control problem, a coupled system involving both the original governing PDE as well as the adjoint PDE must be solved. We show that in the presence of a boundary layer, the local error between the solution of the SUPG discretized optimal control problem and the solution of the infinite dimensional problem is only of first order even if the error is computed locally in a region away from the boundary layer. In the presence of interior layers, we prove optimal convergence rates for the local error in a region away from the layer between the solution of the SUPG discretized optimal control problems and the solution of the infinite dimensional problem. Numerical examples are presented to illustrate some of the theoretical results.

Mathematical formulation and numerical solutions of an optimal Dirichlet boundary control problem for the Boussinesq equations are considered. The solution of the optimal control problem is obtained by adjusting of the temperature on the boundary. We analyze finite element approximations. A gradient method for the solution of the discrete optimal control problem is presented and analyzed. Finally, the results of some computational experiments are presented.

Three algorithms for efficient solution of optimal control problems for high-dimensional systems are presented. Each bypasses the intermediate (and, unnecessary) step of open-loop model reduction. Each also bypasses the solution of the full Riccati equation corresponding to the LQR problem, which is numerically intractable for large n. Motivation for this effort comes from the field of model-based flow control, where open-loop model reduction often fails to capture the dynamics of interest (governed by the Navier–Stokes equation). Our minimum control energy method is a simplified expression for the well-known minimum-energy stabilizing control feedback that depends only on the left eigenvectors corresponding to the unstable eigenvalues of the system matrix A. Our Adjoint of the Direct-Adjoint method is based on the repeated iterative computation of the adjoint of a forward problem, itself defined to be the direct-adjoint vector pair associated with the LQR problem. Our oppositely-shifted subspace iteration (OSSI, the main new result of the present paper) method is based on our new subspace iteration method for computing the Schur vectors corresponding, notably, to the \(m\ll n\) central eigenvalues (near the imaginary axis) of the Hamiltonian matrix related to the Riccati equation of interest. Prototype OSSI implementations are tested on a low-order control problem to illustrate its behavior.

This article presents a unified approach to simultaneous solution of optimization and optimal control problems in batch distillation, operating under different modes of operation: variable, constant, or optimal reflux. The simplified, computationally efficient short‐cut method and a novel algorithm to solve the optimal control problems in batch distillation is the basis of this unified approach. The short‐cut method identifies the feasible region of operation essential for optimization and optimal control problems, and provides analytical partial derivatives of the model parameters crucial to the solution.The new algorithm for the solution of optimal combination of the maximum principle and NLP optimization techniques. It circumvents the problems associated with the maximum principle approach (iterative solution of a two‐point boundary value problem, undounded control variables, and inability to handle the simultaneous optimization and optimal control problem), and the coupled ODE discretization‐NLP optimization scheme for nonlinear models (higher system nonlinearities, multiplicity of solutions, sensitivity of convergence to initial guesses). This algorithm reduces the dimensionality of the problem, and the nature of the algorithm allows a common platform to optimal solutions of different operating conditions. This article also shows that different categories of the optimal control problems in batch distillation essentially involve the solution of the maximum distillate problem.

Existing methods for nonlinear robust control often use scenario‐based approaches to formulate the control problem as large nonlinear optimization problems. The optimization problems are challenging to solve due to their size, especially if the control problems include time‐varying uncertainty. This paper draws from local reduction methods used in semi‐infinite optimization to solve robust optimal control problems with parametric and time‐varying uncertainty. By iteratively adding interim worst‐case scenarios to the problem, methods based on local reduction provide a way to manage the total number of scenarios. We show that the local reduction method for optimal control problems consists of solving a series of simplified optimal control problems to find worst‐case constraint violations. In particular, we present examples where local reduction methods find worst‐case scenarios that are not on the boundary of the uncertainty set. We also provide bounds on the error if local solvers are used. The proposed approach is illustrated with two case studies with parametric and additive time‐varying uncertainty. In the first case study, the number of scenarios obtained from local reduction is 101, smaller than in the case when all extreme scenarios are considered. In the second case study, the number of scenarios obtained from the local reduction is two compared to 512 extreme scenarios. Our approach was able to satisfy the constraints both for parametric uncertainty and time‐varying disturbances, whereas approaches from literature either violated the constraints or became computationally expensive.

Receding horizon methods have become very popular in the last decades for the approximate solution of optimal control problems, model predictive control (MPC) being a popular choice. MPC is to a large extent a model-based feedforward technique and as such its performance is rather sensitive to the model quality. This has prompted much interest in the search of methods to make MPC more robust against deviations such as uncertain parameters. This article presents a way to incorporate additional sensitivity terms into the optimization problem in order to reduce the cost function's sensitivity to the model parameters. For tackling the problem Continuation/GMRES (C/GMRES), a method to solve receding horizon nonlinear optimal control problems in an efficient way, was chosen, however, the general formulation is not restricted to this particular method. The potential performance of the approach is shown by means of simulation examples.

A simplified approach to the solution of linear optimal control problems with quadratic performance indexes is described in this paper. The phase-variable canonical form is used to develop a new type of optimal system equivalence. This concept leads to a substantial simplification of the matrix Riccati equation. The simplified matrix Riccati equation is of the same form for any problem of a given order, say, n, and contains only n nonzero forcing functions. That is, it always corresponds to a set of constant-coefficient scalar differential equations; in various nth-order problems the n nonzero forcing functions and the terminal conditions simply assume different forms. In a very strong sense, this simplified matrix Riccati equation is the simplest possible Riccati equation arising from optimization problems. The method is developed for general time-varying systems with finite terminal time. It is developed also for the important special case of time-invariant systems with infinite terminal time.

This paper describes a novel offline approach to estimate the parameters of a nonlinear system using the optimal control theory. In the conventional methods, only the output is considered in the identification process and the problem is stated as a nonlinear optimization problem. Nevertheless, the proposed method here is based on the least square error of both output and input. To do this, the problem is first stated as a tracking problem with some unknown parameters. The necessary and sufficiency conditions of optimality conditions are derived using the fundamental theorem of variational calculus. The problem is deployed as an effort optimal control problem which finally leads to a two point boundary value problem. To solve the resultant equations, a secondary optimal control problem is deployed to be solved using the homotopy algorithm. So the parameters are gradually converged to the real values. The proposed algorithm is analyzed for a one-link manipulator with the full measurements. Thereafter, the proposed method is applied on a real one-link manipulator and nonlinear model of permanent magnet dc motor. Application of the method for the identification of a few test beds at the AUT proves the validity and efficiency of the proposed approach.

A neural network based optimal control synthesis is presented for solving optimal control problems with control and state constraints. The optimal control problem is transcribed into nonlinear programming problem which is implemented with adaptive critic neural network. The proposed simulation methods is illustrated by the optimal control problem of feeding adaptation of filter feeders of Daphnia. Results show that adaptive critic based systematic approach holds promise for obtaining the optimal control with control and state constraints.

Optimal control problems are common in aerospace engineering. A Python software program called PySCP is described for solving multiple-phase optimal control problems using sequential convex programming methods. By constructing a series of approximated second-order cone programming subproblems, PySCP approaches to the solution of the original optimal control problem in an iterative way. The key components of the software are described in detail, including convexification, discretization, and the adaptive trust region method. The convexification of the first-order differential dynamic equation is implemented using successive linearization. Six discretization methods, including zero-order hold, first-order hold, Runge-Kutta, and three hp pseudospectral collocation methods, are implemented so that different types of optimal control problems can be tackled efficiently. Adaptive trust region method is employed, and robust convergence is achieved. Both free-final-time problem and fixed-final-time problem can be solved by the software. The application of the software is demonstrated on three optimal control problems with varying complexity. PySCP provides researchers a useful toolkit to solve a wide variety of optimal control problems using sequential convex programming.

This paper deals with the reconstruction of the desired demand in an optimal control problem, stated over a tree-shaped transportation network which is governed by a linear hyperbolic conservation law. As desired demands typically undergo fluctuations due to seasonality or unexpected events making short-term adjustments necessary, such an approach can exemplary be used for forecasting from past data. We suggest to model this problem as a so-called inverse optimal control problem, i.e., a hierarchical optimization problem whose inner problem is the optimal control problem and whose outer problem is the reconstruction problem. In order to guarantee the existence of solutions in the function space framework, the hyperbolic conservation law is interpreted in weak sense allowing for control functions in Lebesgue spaces. For the computational treatment of the model, we transfer the hierarchical problem into a nonsmooth single-level one by plugging the uniquely determined solution of the inner optimal control problem into the outer reconstruction problem before applying techniques from nonsmooth optimization. Some numerical experiments are presented to visualize various features of the model including different types of noise in the demand and strategies of how to observe the network in order to obtain good reconstructions of the desired demand.

An enhanced scheme of transcribing the system dynamics for the numerical solution of optimal control problems is proposed. This new scheme is based on the standard method of direct collocation that converts an optimal control problem into a nonlinear programming problem via simultaneous state and control discretization. When compared with the standard method, the enhanced scheme has the advantage of higher solution accuracy with minimal additional computational effort. It is particularly suited for systems with states that are related to each other in a special form. For such systems, the ensuing nonlinear programming problem has the same number of constraints as those using the standard method. Numerical results on several optimal control problems using the enhanced scheme are presented, together with comparisons with the results obtained from the standard scheme.

We study optimal control problems with vector-valued controls. In the article, we propose a solution strategy to solve optimal control problems with pointwise convex control constraints. It involves a SQP-like step with an imbedded active-set algorithm.keywordsOptimal controlconvex control constraintsset-valued mappings

Algorithms for the numerical solution of optimal control problems with bounded state variables are developed. Two main cases are considered: either the control variable appears nonlinearly or the control variable appears linearly. In the first case, an extremal are touching the boundary or containing a boundary arc, is shown to satisfy a suitable two-point boundary value problem. In the second case, a numerical idea for solving the problem in statespace is presented which dispenses with the Lagrange-multipliers. Three numerical examples are discussed illustrating the efficiency of the different algorithms. The encountered two-point boundary value problems are solved with the method of multiple shooting.