Back to Search
Start Over
Relations between Abs-Normal NLPs and MPCCs. Part 1: Strong Constraint Qualifications
- Source :
- Journal of Nonsmooth Analysis and Optimization, Volume 2, Original research articles (February 18, 2021) jnsao:6672
- Publication Year :
- 2020
-
Abstract
- This work is part of an ongoing effort of comparing non-smooth optimization problems in abs-normal form to MPCCs. We study the general abs-normal NLP with equality and inequality constraints in relation to an equivalent MPCC reformulation. We show that kink qualifications and MPCC constraint qualifications of linear independence type and Mangasarian-Fromovitz type are equivalent. Then we consider strong stationarity concepts with first and second order optimality conditions, which again turn out to be equivalent for the two problem classes. Throughout we also consider specific slack reformulations suggested in [9], which preserve constraint qualifications of linear independence type but not of Mangasarian-Fromovitz type.
- Subjects :
- Mathematics - Optimization and Control
90C30, 90C33, 90C46
Subjects
Details
- Database :
- arXiv
- Journal :
- Journal of Nonsmooth Analysis and Optimization, Volume 2, Original research articles (February 18, 2021) jnsao:6672
- Publication Type :
- Report
- Accession number :
- edsarx.2007.14654
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.46298/jnsao-2021-6672