Benko, Matúš; Gfrerer, Helmut New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints. (English) Zbl 1398.90169 Optimization 67, No. 1, 1-23 (2018). MSC: 90C30 PDFBibTeX XMLCite \textit{M. Benko} and \textit{H. Gfrerer}, Optimization 67, No. 1, 1--23 (2018; Zbl 1398.90169) Full Text: DOI arXiv
Benko, Matúš; Gfrerer, Helmut An SQP method for mathematical programs with vanishing constraints with strong convergence properties. (English) Zbl 1406.90094 Comput. Optim. Appl. 67, No. 2, 361-399 (2017). MSC: 90C26 90C55 49M37 PDFBibTeX XMLCite \textit{M. Benko} and \textit{H. Gfrerer}, Comput. Optim. Appl. 67, No. 2, 361--399 (2017; Zbl 1406.90094) Full Text: DOI arXiv
Benko, Matus; Gfrerer, Helmut On estimating the regular normal cone to constraint systems and stationarity conditions. (English) Zbl 1394.90526 Optimization 66, No. 1, 61-92 (2017). MSC: 90C30 PDFBibTeX XMLCite \textit{M. Benko} and \textit{H. Gfrerer}, Optimization 66, No. 1, 61--92 (2017; Zbl 1394.90526) Full Text: DOI arXiv
Benko, Matus; Gfrerer, Helmut An SQP method for mathematical programs with complementarity constraints with strong convergence properties. (English) Zbl 1357.49124 Kybernetika 52, No. 2, 169-208 (2016). MSC: 49M37 90C26 90C33 90C55 PDFBibTeX XMLCite \textit{M. Benko} and \textit{H. Gfrerer}, Kybernetika 52, No. 2, 169--208 (2016; Zbl 1357.49124) Full Text: DOI Link