Relations between ABS-normal NLPs and MPCCs. I: Strong constraint qualifications

DOI10.46298/JNSAO-2021-6672MaRDI QIDQ6567220zbMATH OpenFDO

Authors Lisa C. Hegerhorst-Schultchen, Christian Kirches, Marc C. Steinbach

Publication date 4 July 2024

Published in Journal of Nonsmooth Analysis and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Recommendations

• Relations between ABS-normal NLPs and MPCCs. II: Weak constraint qualifications
• On the relation between MPECs and optimization problems in abs-normal form
• On first and second order optimality conditions for ABS-normal NLP
• Constraint qualifications for constrained Lipschitz optimization problems and applications to a MPCC
• scientific article; zbMATH DE number 6453520

Cited in

(1)

• Relations between ABS-normal NLPs and MPCCs. II: Weak constraint qualifications

This page was built for publication: Relations between ABS-normal NLPs and MPCCs. I: Strong constraint qualifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567220)