1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.OC2016
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…
math.OC2016★ 1 cited
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…