activity
20192026
most citedWhy second-order sufficient conditions are, in a way, easy -- or -- revisiting calculus for second subderivatives

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

collaborators
Showing math.OCShow all

6 papers · 1 filter

math.OC2026

Second-order optimality conditions for optimization problems with generalized equation constraints

M. Benko, H. Gfrerer, J. J. Ye +2

This paper provides second-order optimality conditions for optimization problems with generalized equation constraints (GEPs), a framework that encompasses several important and ch…

math.OC2026

Variational Sufficiency and Solution Stability in Optimization

Matúš Benko, R. Tyrrell Rockafellar

Variational stability, in the sense of local good behavior of optimal values and solutions in problems of optimization under shifts in parameters, is important not only for validat…

math.OC2024

Isolated calmness of perturbation mappings in generalized nonlinear programming and local superlinear convergence of Newton-type methods

Matúš Benko, Patrick Mehlitz

In this paper, we characterize Lipschitzian properties of different multiplier-free and multiplier-dependent perturbation mappings associated with the stationarity system of a so-c…

math.OC2022★ 3 cited

Why second-order sufficient conditions are, in a way, easy -- or -- revisiting calculus for second subderivatives

Matúš Benko, Patrick Mehlitz

In this paper, we readdress the classical topic of second-order sufficient optimality conditions for optimization problems with nonsmooth structure. Based on the so-called second s…

math.OC2022

On the directional asymptotic approach in optimization theory Part B: constraint qualifications

Matúš Benko, Patrick Mehlitz

During the last years, asymptotic (or sequential) constraint qualifications, which postulate upper semicontinuity of certain set-valued mappings and provide a natural companion of…

math.OC2019

Sufficient Conditions for Metric Subregularity of Constraint Systems with Applications to Disjunctive and Ortho-Disjunctive Programs

Matúš Benko, Michal Červinka, Tim Hoheisel

This paper is devoted to the study of the metric subregularity constraint qualification (MSCQ) for general optimization problems, with the emphasis on the nonconvex setting. We ela…