Refine
Language
- English (5)
Keywords
- optimal control (4)
- state constraints (2)
- Newton methods in function space (1)
- adaptive mesh refinement (1)
- adaptive methods (1)
- adaptivity (1)
- continuity of Nemyckii Operators (1)
- finite elements (1)
- function space (1)
- generic programming (1)
Project
- A1 (5) (remove)
Interior Point Methods in Function Space for State Constraints - Inexact Newton and Adaptivity
(2009)
We consider an interior point method in function space for PDE constrained optimal control problems with state constraints. Our emphasis is on the construction and analysis of an algorithm that integrates a Newton path-following method with adaptive grid refinement. This is done in the framework of inexact Newton methods in function space, where the discretization error of each Newton step is controlled by adaptive grid refinement in the innermost loop. This allows to perform most of the required Newton steps on coarse grids, such that the overall computational time is dominated by the last few steps. For this purpose we propose an a-posteriori error estimator for a problem suited norm.
A continuity result for Nemyckii Operators and some applications in PDE constrained optimal control
(2008)
This work explores two applications of a classical result on the continuity of Nemyckii operators to optimal control with PDEs. First, we present an alternative approach to the analysis of Newton's method for function space problems involving semi-smooth Nemyckii operators. A concise proof for superlinear convergence is presented, and sharpened bounds on the rate of convergence are derived. Second, we derive second order sufficient conditions for problems, where the underlying PDE has poor regularity properties. We point out that the analytical structure in both topics is essentially the same.
We propose and analyse an interior point path-following method in function space
for state constrained optimal control. Our emphasis is on proving convergence in
function space and on constructing a practical path-following algorithm. In particular, the introduction of a pointwise damping step leads to a very efficient method, as verified by numerical experiments.
The paper proposes goal-oriented error estimation and mesh refinement
for optimal control problems with elliptic PDE constraints using the value
of the reduced cost functional as quantity of interest. Error representation,
hierarchical error estimators, and greedy-style error indicators are derived and
compared to their counterparts when using the all-at-once cost functional as
quantity of interest. Finally, the efficiency of the error estimator and generated
meshes are demonstrated on numerical examples.
This paper presents concepts and implementation of the finite element toolbox Kaskade 7, a flexible C++ code for solving elliptic and parabolic PDE systems. Issues such as problem formulation, assembly and adaptivity are discussed at the example of optimal control problems. Trajectory compression for parabolic optimization problems is considered as a case study.