Adaptive approximation algorithm for relaxed optimization problems
The authors study the approximation of solutions of abstract control problems of the form ~minimize \( \Phi( u)\) subject to \(u\in L^p(\Omega;{\mathbb R}^m)\), \(u(x) \in \Omega\) for \(x\in \Omega\). By using \(L^p\)-Young measures they first define a relaxed problem and next an approximate relaxed problem, which is a restriction of the relaxed problem to a finite dimensional convex set constructed with a triangulation of \(\Omega\) and characteristic functions of simplexes of the triangulation. The algorithm is based on an adaptive strategy for the mesh size \(d\) of the triangulation and a tolerance parameter \(\varepsilon\) for the constraints. The algorithm is tested on different optimal control problems governed by ordinary differential equations. For the entire collection see [Zbl 0967.00097].
- Approximations of relaxed optimal control problems
- scientific article; zbMATH DE number 1805984
- A computational method for a class of optimal relaxed control problems
- Convergent computational method for relaxed optimal control problems
- Approximation of relaxed nonlinear parabolic optimal control problems
This page was built for publication: Adaptive approximation algorithm for relaxed optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2751483)