A geometric characterization of the tangent cone to feasible points in MPECs yields stationarity concepts and constraint qualifications that avoid the strong nondegeneracy and smoothness assumptions required by classical nonlinear programming approaches.
In: 2024 IEEE 63rd Conference on 24 Decision and Control (CDC), pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
First-Order Optimality Conditions for Mathematical Programming with Equilibrium Constraints
A geometric characterization of the tangent cone to feasible points in MPECs yields stationarity concepts and constraint qualifications that avoid the strong nondegeneracy and smoothness assumptions required by classical nonlinear programming approaches.