An adaptive edge element method and its convergence for an electromagnetic constrained optimal control problem

In this work, an adaptive edge element method is developed for an H(curl)-elliptic constrained optimal control problem. We use the lowest-order Nedelec’s edge elements of first family and the piecewise (element-wise) constant functions to approximate the state and the control, respectively, and propose a new adaptive algorithm with error estimators involving both residual-type error estimators and lower-order data oscillations. By using a local regular decomposition for H(curl)-functions and the standard bubble function techniques, we derive the a posteriori error estimates for the proposed error estimators. Then we exploit the convergence properties of the orthogonal L^2- projections and the mesh-size functions to demonstrate that the sequences of the discrete states and controls generated by the adaptive algorithm converge strongly to the exact solutions of the state and control in the energy norm and L^2 -norm, respectively, by first achieving the strong convergence towards the solution to a limiting control problem. Three-dimensional numerical experiments are also presented to confirm our theoretical results and the quasi-optimality of the adaptive edge element method.

Warm Start Method for Solving Chance Constrained Optimal Control Problems Using Biased Kernel Density Estimators

A warm start method is developed for efficiently solving complex chance constrained optimal control problems. The warm start method addresses the computational challenges of solving chance constrained optimal control problems using biased kernel density estimators and Legendre-Gauss-Radau collocation with an $hp$ adaptive mesh refinement method. To address the computational challenges, the warm start method improves both the starting point for the chance constrained optimal control problem, as well as the efficiency of cycling through mesh refinement iterations. The improvement is accomplished by tuning a parameter of the kernel density estimator, as well as implementing a kernel switch as part of the solution process. Additionally, the number of samples for the biased kernel density estimator is set to incrementally increase through a series of mesh refinement iterations. Thus, the warm start method is a combination of tuning a parameter, a kernel switch, and an incremental increase in sample size. This warm start method is successfully applied to solve two challenging chance constrained optimal control problems in a computationally efficient manner using biased kernel density estimators and Legendre-Gauss-Radau collocation.

New Preconditioned Iteration Method Solving the Special Linear System from the PDE-Constrained Optimal Control Problem

In many fields of science and engineering, partial differential equation (PDE) constrained optimal control problems are widely used. We mainly solve the optimization problem constrained by the time-periodic eddy current equation in this paper. We propose the three-block splitting (TBS) iterative method and proved that it is unconditionally convergent. At the same time, the corresponding TBS preconditioner is derived from the TBS iteration method, and we studied the spectral properties of the preconditioned matrix. Finally, numerical examples in two-dimensions is applied to demonstrate the advantages of the TBS iterative method and TBS preconditioner with the Krylov subspace method.