Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization
DOI10.1016/J.AUTOMATICA.2019.108653zbMATH Open1431.49029OpenAlexW2983118515WikidataQ126842711 ScholiaQ126842711MaRDI QIDQ2288641FDOQ2288641
Authors: Eduardo S. Schultz, Ralf Hannemann-Tamás, Alexander Mitsos 
Publication date: 20 January 2020
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2019.108653
Recommendations
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
- Algorithms for PDE-constrained optimization
- The smoothed-penalty algorithm for state constrained optimal control problems for partial differential equations
- Optimal control problems with a continuous inequality constraint on the state and the control
dynamic optimizationoptimal controlpartial differential equationssemi-infinite programspath constraintsinequality state constraints
Dynamic programming (90C39) Optimality conditions for problems involving partial differential equations (49K20)
Cites Work
- A posteriori error estimation in finite element analysis
- Recent advances in the analysis of pointwise state-constrained elliptic optimal control problems
- Title not available (Why is that?)
- On linear-quadratic elliptic control problems of semi-infinite type
- Convergence of a Finite Element Approximation to a State-Constrained Elliptic Control Problem
- A priori error estimates for space-time finite element discretization of semilinear parabolic optimal control problems
- Pontryagin's Principle for State-Constrained Control Problems Governed by Parabolic Equations with Unbounded Controls
- Title not available (Why is that?)
- Numerical methods for optimal control problems with state constraints
- Global optimization of semi-infinite programs via restriction of the right-hand side
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- Discrete concepts versus error analysis in PDE-constrained optimization
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
- Pontryagin principle for state-constrained control problems governed by a first-order PDE system
- An adaptive numerical method for semi-infinite elliptic control problems based on error estimates
Cited In (2)
This page was built for publication: Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288641)
