1 citations · 1 across the 2 of their papers we have counts for
4 papers · 1 filter
On the directional asymptotic approach in optimization theory
Matúš Benko, Patrick Mehlitz
As a starting point of our research, we show that, for a fixed order , each local minimizer of a rather general nonsmooth optimization problem in Euclidean spaces is eithe…
Primal-Dual Stability in Local Optimality
Matus Benko, R. Tyrrell Rockafellar
Much is known about when a locally optimal solution depends in a single-valued Lipschitz continuous way on the problem's parameters, including tilt perturbations. Much less is know…
New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
Matúš Benko, Helmut Gfrerer
In this paper we consider a sufficiently broad class of nonlinear mathematical programs with disjunctive constraints, which, e.g., include mathematical programs with complemetarity…
An SQP method for mathematical programs with vanishing constraints with strong convergence properties
Matúš Benko, Helmut Gfrerer
We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm…