2005
DOI: 10.1002/pamm.200510013
|View full text |Cite
|
Sign up to set email alerts
|

Towards Matrix‐Free AD‐Based Preconditioning of KKT Systems in PDE‐Constrained Optimization

Abstract: The presented approach aims at solving an equality constrained, finite-dimensional optimization problem, where the constraints arise from the discretization of some partial differential equation (PDE) on a given space grid. For this purpose, a stationary point of the Lagrangian is computed using Newton's method, which requires the repeated solution of KKT systems. The proposed algorithm focuses on two topics: Firstly, Algorithmic Differentiation (AD) will be used to evaluate the necessary computations of gradi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2008
2008
2012
2012

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…Discrete second order adjoints (obtained by linearizing the numerical approximations of the model) have been obtained by automatic differentiation [7,9,10].…”
Section: Introductionmentioning
confidence: 99%
“…Discrete second order adjoints (obtained by linearizing the numerical approximations of the model) have been obtained by automatic differentiation [7,9,10].…”
Section: Introductionmentioning
confidence: 99%
“…Discrete second order adjoints (obtained by linearizing the numerical approximations of the model) have been obtained by automatic differentiation [19,40,7].…”
mentioning
confidence: 99%