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.
SIAM Journal on Control and Optimization61(3), 1113–1135 (2023)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Exact penalization for MPECs is enabled under broader conditions by fractional-order penalties derived from Lojasiewicz error bounds on KKT residual mappings.
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.
-
Introduction to Exact Penalization for Mathematical Programming with Equilibrium Constraints
Exact penalization for MPECs is enabled under broader conditions by fractional-order penalties derived from Lojasiewicz error bounds on KKT residual mappings.