Exact penalization for MPECs is enabled under broader conditions by fractional-order penalties derived from Lojasiewicz error bounds on KKT residual mappings.
Linear Algebra and its Applications95, 97–109 (1987)
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
An MPEC is an optimization problem whose feasible set is partly defined by another optimization, variational inequality, complementarity system, or equilibrium model.
citing papers explorer
-
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.
-
Introduction to Mathematical Programming with Equilibrium Constraints (MPECs) and Bilevel Optimization
An MPEC is an optimization problem whose feasible set is partly defined by another optimization, variational inequality, complementarity system, or equilibrium model.