2014
DOI: 10.1007/978-3-319-05083-6_9
|View full text |Cite
|
Sign up to set email alerts
|

Elliptic Mathematical Programs with Equilibrium Constraints in Function Space: Optimality Conditions and Numerical Realization

Abstract: Recent advances in the analytical as well as numerical treatment of classes of elliptic mathematical programs with equilibrium constraints (MPECs) in function space are discussed. In particular, stationarity conditions for control problems with point tracking objectives and subject to the obstacle problem as well as for optimization problems with variational inequality constraints and pointwise constraints on the gradient of the state are derived. For the former problem class including the case of L 2 -trackin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 40 publications
0
2
0
Order By: Relevance
“…The resulting problems present several difficulties due to the frequent non-smoothness of the lower-level problem (think of TV regularization), which, in general, makes it impossible to verify Karush–Kuhn–Tucker constraint qualification conditions. This issue has led to the development of alternative analytical approaches in order to obtain first-order necessary optimality conditions (Bonnans and Tiba 1991, De los Reyes 2011, Hintermüller, Laurain, Löbhard, Rautenberg and Surowiec 2014). The bilevel problems under consideration are also related to generalized mathematical programs with equilibrium constraints in function spaces (Luo, Pang and Ralph 1996, Outrata 2000).…”
Section: Learning In Functional Analytic Regularizationmentioning
confidence: 99%
“…The resulting problems present several difficulties due to the frequent non-smoothness of the lower-level problem (think of TV regularization), which, in general, makes it impossible to verify Karush–Kuhn–Tucker constraint qualification conditions. This issue has led to the development of alternative analytical approaches in order to obtain first-order necessary optimality conditions (Bonnans and Tiba 1991, De los Reyes 2011, Hintermüller, Laurain, Löbhard, Rautenberg and Surowiec 2014). The bilevel problems under consideration are also related to generalized mathematical programs with equilibrium constraints in function spaces (Luo, Pang and Ralph 1996, Outrata 2000).…”
Section: Learning In Functional Analytic Regularizationmentioning
confidence: 99%
“…The resulting problems are difficult to treat due to the non-smooth structure of the lower level problem, which makes it impossible to verify standard constraint qualification conditions for Karush-Kuhn-Tucker (KKT) systems. Therefore, in order to obtain characterising first-order necessary optimality conditions, alternative analytical approaches have emerged, in particular regularisation techniques [4,20,28]. We consider such an approach here and study the related regularised problem in depth.…”
Section: Introductionmentioning
confidence: 98%