Optimization theory in Banach spaces suffers from a lack of available constraint
qualifications. There exist very few constraint qualifications, and these are often violated …

Comparison of optimality systems for the optimal control of the obstacle problem Page 1
GAMM-Mitt. 40, No. 4, 312 – 338 (2017) / DOI 10.1002/gamm.201740004 Comparison of …

We consider an optimal control problem, whose state is given as the solution of the obstacle
problem. The controls are not assumed to be dense in H^-1(Ω). Hence, local minimizers may …

This thesis is concerned with a class of general-purpose algorithms for constrained
minimization problems, variational inequalities, and quasi-variational inequalities in Banach …

We consider subsets of Lebesgue spaces which are defined by pointwise constraints. We
provide formulas for corresponding variational objects (tangent and normal cones). Our …

In this article, we consider a general bilevel programming problem in reflexive Banach
spaces with a convex lower level problem. In order to derive necessary optimality conditions …

We propose an augmented Lagrangian method for the solution of constrained optimization
problems in Banach spaces. The framework we consider is very general and encompasses …

In this chapter, we are concerned with inverse optimal control problems, ie, optimization
models which are used to identify parameters in optimal control problems from given …

We consider bilevel optimization problems which can be interpreted as inverse optimal
control problems. The lower-level problem is an optimal control problem with a parametrized …

The simple convex bilevel programming problem is a convex minimization problem whose
feasible set is the solution set of another convex optimization problem. Such problems …