activity
20202023
most citedA new elementary proof for M-stationarity under MPCC-GCQ for mathematical programs with complementarity constraints

3 citations · 6 across the 6 of their papers we have counts for

collaborators
Showing math.OCShow all

6 papers · 1 filter

math.OC2023★ 2 cited

Bilevel Optimal Control: Theory, Algorithms, and Applications

Stephan Dempe, Markus Friedemann, Felix Harder +2

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

math.OC2022

Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods

Markus Friedemann, Felix Harder, Gerd Wachsmuth

We present a method to solve a special class of parameter identification problems for an elliptic optimal control problem to global optimality. The bilevel problem is reformulated…

math.OC2021

M-stationarity for a class of MPCCs in Lebesgue spaces

Felix Harder, Gerd Wachsmuth

We show that an optimality condition of M-stationarity type holds for minimizers of a class of mathematical programs with complementarity constraints (MPCCs) in Lebesgue spaces. We…

math.OC2021★ 1 cited

New stationarity conditions between strong and M-stationarity for mathematical programs with complementarity constraints

Felix Harder

We introduce new first-order necessary conditions for mathematical programs with complementarity constraints (MPCCs), which lie between strong and M-stationarity and have a relativ…

math.OC2020★ 3 cited

A new elementary proof for M-stationarity under MPCC-GCQ for mathematical programs with complementarity constraints

Felix Harder

It is known in the literature that local minimizers of mathematical programs with complementarity constraints (MPCCs) are so-called M-stationary points, if a weak MPCC-tailored Gui…

math.OC2020

Reformulation of the M-stationarity conditions as a system of discontinuous equations and its solution by a semismooth Newton method

Felix Harder, Patrick Mehlitz, Gerd Wachsmuth

We show that the Mordukhovich-stationarity system associated with a mathematical program with complementarity constraints (MPCC) can be equivalently written as a system of disconti…