2007
DOI: 10.1137/060660977
|View full text |Cite
|
Sign up to set email alerts
|

Symmetric Indefinite Preconditioners for Saddle Point Problems with Applications to PDE-Constrained Optimization Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
172
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 151 publications
(173 citation statements)
references
References 18 publications
1
172
0
Order By: Relevance
“…This matrix is typically very large and sparse, and the system (4.2) is generally solved iteratively. It was shown in [33] that two preconditioners that are optimal in terms of the mesh size taken are We note that other preconditioners have been developed which may be better suited for small β, for example a block triangular preconditioner [3], or preconditioners that are β independent [30,43]. Here our aim is not to argue that this is the way one should solve such control problems-justifying such a claim would require more exhaustive tests and domain-specific theory, and as such is beyond the scope of the work.…”
Section: Pde-constrained Optimizationmentioning
confidence: 99%
See 2 more Smart Citations
“…This matrix is typically very large and sparse, and the system (4.2) is generally solved iteratively. It was shown in [33] that two preconditioners that are optimal in terms of the mesh size taken are We note that other preconditioners have been developed which may be better suited for small β, for example a block triangular preconditioner [3], or preconditioners that are β independent [30,43]. Here our aim is not to argue that this is the way one should solve such control problems-justifying such a claim would require more exhaustive tests and domain-specific theory, and as such is beyond the scope of the work.…”
Section: Pde-constrained Optimizationmentioning
confidence: 99%
“…Note that the norm of the control appears in the cost functional, along with a Tikhonov regularization parameter, β, to ensure that the problem is well-posed. If we discretize the problem using finite elements, then the minimum of the discretized cost functional is found by solving the linear system of equations [33], [43] …”
Section: Pde-constrained Optimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…This is in agreement with the theory, as this problem has more unknowns and its matrix is indefinite. A better approach for the solution of this problem may reduce the time involved in solving this problem (see the work of Schöberl and Zulehner [33] and Zulehner [36] for instance). Figure 1.…”
Section: Computational Timementioning
confidence: 99%
“…If neither direct factorization nor the Schur complement reduction are applicable, iterative solvers have to be used. For a survey of saddle point solvers we refer to [2] and the references summarized in [32]. As the reduced problem on ker C is positive definite, we focus on conjugate gradient methods.…”
Section: Computing (Simplified) Normal Steps and Adjoint Updatesmentioning
confidence: 99%