Convergence of the coincidence set in the homogenization of the obstacle problem
Convergence results for two Lagrange-Newton-type methods of solving optimal control problems are presented. It is shown how the methods can be applied to a class of optimal control problems for nonlinear ODEs, subject to mixed control-state constraints. The first method reduces to an SQP algorithm. It does not require any information on the structure of the optimal solution. The other one is the shooting method, where information on the structure of the optimal solution is exploited. In each case,...
Many numerical simulations in (bilinear) quantum control use the monotonically convergent Krotov algorithms (introduced by Tannor et al. [Time Dependent Quantum Molecular Dynamics (1992) 347–360]), Zhu and Rabitz [J. Chem. Phys. (1998) 385–391] or their unified form described in Maday and Turinici [J. Chem. Phys. (2003) 8191–8196]. In Maday et al. [Num. Math. (2006) 323–338], a time discretization which preserves the property of monotonicity has been presented. This paper introduces a proof of...
Many inverse problems for differential equations can be formulated as optimal control problems. It is well known that inverse problems often need to be regularized to obtain good approximations. This work presents a systematic method to regularize and to establish error estimates for approximations to some control problems in high dimension, based on symplectic approximation of the Hamiltonian system for the control problem. In particular the work derives error estimates and constructs regularizations...
In this article we modify an iteration process to prove strong convergence and Δ- convergence theorems for a finite family of nonexpansive multivalued mappings in hyperbolic spaces. The results presented here extend some existing results in the literature.
The numerical minimization of the functional , is addressed. The function is continuous, has linear growth, and is convex and positively homogeneous of degree one in the second variable. We prove that can be equivalently minimized on the convex set and then regularized with a sequence , of stricdy convex functionals defined on . Then both and , can be discretized by continuous linear finite elements. The convexity property of the functionals on is useful in the numerical minimization...
We address the numerical minimization of the functional , for . We note that can be equivalently minimized on the larger, convex, set and that, on that space, may be regularized with a sequence of regular functionals. Then both and can be discretized by continuous linear finite elements. The convexity of the functionals in is useful for the numerical minimization of . We prove the -convergence of the discrete functionals to and present a few numerical examples.