2016
DOI: 10.1007/s11228-016-0366-7
|View full text |Cite
|
Sign up to set email alerts
|

Stability of Saddle Points Via Explicit Coderivatives of Pointwise Subdifferentials

Abstract: We derive stability criteria for saddle points of a class of nonsmooth optimization problems in Hilbert spaces arising in PDE-constrained optimization, using metric regularity of infinite-dimensional set-valued mappings. A main ingredient is an explicit pointwise characterization of the regular coderivative of the subdifferential of convex integral functionals. This is applied to several stability properties for parameter identification problems for an elliptic partial differential equation with non-differenti… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
13
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(13 citation statements)
references
References 46 publications
0
13
0
Order By: Relevance
“…Hence, for the sake of consistency with [9], we denote the infimum over valid constants by R −1 ( w| q), or R −1 for short when there is no ambiguity about the point ( w, q). Metric regularity is then equivalent to R −1 ( w| q) > 0.…”
Section: Notation and Definitionsmentioning
confidence: 99%
See 4 more Smart Citations
“…Hence, for the sake of consistency with [9], we denote the infimum over valid constants by R −1 ( w| q), or R −1 for short when there is no ambiguity about the point ( w, q). Metric regularity is then equivalent to R −1 ( w| q) > 0.…”
Section: Notation and Definitionsmentioning
confidence: 99%
“…Metric regularity-whose verification is the main difficulty in function spaces and will be investigated based on the results of [9] at the end of this section-allows one to remove the squares from ( D 2 -loc-γ-F * ) and bridge from the perturbed local solutions q i to local solutions q i . This is done through a sequence of technical lemmas in [20, Theorem 2.6.…”
Section: Convergencementioning
confidence: 99%
See 3 more Smart Citations