Workshop notes explain the hypotheses required for first-order optimality conditions in MPECs and how to classify models and prove those hypotheses in practice.
Time-varying semidefinite programming: Path following a burer–monteiro factorization.SIAM Journal on Optimization, 34(1):1–26
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
-
Optimization Workshop Notes for Mathematical Programming with Equilibrium Constraints (MPECs): Verification of MPEC Hypotheses
Workshop notes explain the hypotheses required for first-order optimality conditions in MPECs and how to classify models and prove those hypotheses in practice.