✦ LIBER ✦

Algorithms for PDE-constrained optimization

✍ Scribed by Roland Herzog; Karl Kunisch

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 166 KB
Volume: 33
Category: Article
ISSN: 0936-7195
DOI: 10.1002/gamm.201010013

No coin nor oath required. For personal study only.

✦ Synopsis

Some first and second order algorithmic approaches for the solution of PDE-constrained optimization problems are reviewed. An optimal control problem for the stationary Navier-Stokes system with pointwise control constraints serves as an illustrative example. Some issues in treating inequality constraints for the state variable and alternative objective functions are also discussed.

📜 SIMILAR VOLUMES

PDE-constrained optimization for advance

PDE-constrained optimization for advanced materials

✍ Günter Leugering; Michael Stingl 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 354 KB

## Abstract In these notes we consider PDE‐constrained optimization in the context of advanced materials. We give examples for optimization and control in the coefficients, free material optimization, topology optimization, shape optimization in elastic and piezo‐electric materials. We explain some

Block-triangular preconditioners for PDE

Block-triangular preconditioners for PDE-constrained optimization

✍ Tyrone Rees; Martin Stoll 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 475 KB

POD-Galerkin approximations in PDE-const

POD-Galerkin approximations in PDE-constrained optimization

✍ Ekkehard W. Sachs; Stefan Volkwein 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

## Abstract Proper orthogonal decomposition (POD) is one of the most popular model reduction techniques for nonlinear partial differential equations. It is based on a Galerkin‐type approximation, where the POD basis functions contain information from a solution of the dynamical system at pre‐specif

Optimal Algorithms for Constrained Recon

Optimal Algorithms for Constrained Reconfigurable Meshes

✍ Bryan Beresford-Smith; Oliver Diessel; Hossam ElGindy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 220 KB

model the propagation delay on a bus-unit 1 by a constant, and to only permit the class of algorithms, denoted by A k , which configure bus components bound in size to at most k bus-units to run on the model. We give a detailed description of our reconfigurable mesh model in the following section.

Particle swarm optimization algorithm fo

Particle swarm optimization algorithm for constrained problems

✍ Jian-Ming Zhang; Lei Xie 📂 Article 📅 2009 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 104 KB 👁 1 views

Discrete concepts versus error analysis

Discrete concepts versus error analysis in PDE-constrained optimization

✍ Michael Hinze; Fredi Tröltzsch 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB 👁 1 views

Solutions to optimization problems with pde constraints inherit special properties; the associated state solves the pde which in the optimization problem takes the role of a equality constraint, and this state together with the associated control solves an optimization problem, i.e. together with mu