Institute of Numerical Mathematics

M. Benko.
On inner calmness*, generalized calculus, and derivatives of the normal-cone map.
Journal of Nonsmooth Analysis and Optimization, 2 (2021), pp. 27.
DOI arxiv.
M. Benko, M. Červinka, T. Hoheisel.
Sufficient Conditions for Metric Subregularity of Constraint Systems with Applications to Disjunctive and Ortho-Disjunctive Programs.
Set-Valued and Variational Analysis, 30 (2022), pp 143-177.
DOI arxiv
M. Benko, H. Gfrerer, J. V. Outrata.
Stability analysis for parameterized variational systems with implicit constraints.
Set-Valued and Variational Analysis, 28 (2020), pp. 167-193.
DOI arxiv
M. Benko, H. Gfrerer, B. S. Mordukhovich.
Characterizations of Tilt-Stable Minimizers in Second-Order Cone Programming.
SIAM Journal on Optimization, 29 (2019), pp. 3100-3130.
DOI arxiv
M. Benko, H. Gfrerer, J. V. Outrata.
Calculus for directional limiting normal cones and subdifferentials.
Set-Valued and Variational Analysis, 27 (2019), pp. 713-745.
DOI arxiv
M. Benko, H. Gfrerer.
New verifiable stationary concepts for a class of mathematical programs with disjunctive constraints.
Optimization, 67 (2018), pp. 1-23.
DOI arxiv
M. Benko, H. Gfrerer.
An SQP method for mathematical programs with vanishing constraints with strong convergence properties.
Computational Optimization and Applications, 67 (2017), pp. 361-399.
DOI arxiv
M. Benko, H. Gfrerer.
On estimating the regular normal cone to constraint systems and stationary conditions.
Optimization, 66 (2017), pp. 61-92.
DOI NuMa-Report
M. Benko, H. Gfrerer.
An SQP method for mathematical programs with complementarity constraints with strong convergence properties.
Kybernetika, 52 (2016), pp. 169-208.
DOI
M. Benko.
Numerical methods for mathematical programs with disjunctive constraints.
PhD-Thesis, Univ. Linz (2016), pp. 130.
pdf

Title
Name

Phone
+43 732 2468 40xx

Email
xxx.xxx@jku.at

Location
Science Park 2, 3rd floor, S2 3xx

show on campus map

Matúš Benko

Research Interests

Publications

Short Curriculum Vitae

Links

Teaching