Optimization Workshop Notes for Mathematical Programming with Equilibrium Constraints (MPECs): Verification of MPEC Hypotheses
Jiguang Yu

TL;DR
This paper provides a rigorous introduction to the mathematical foundations of MPECs, focusing on hypothesis verification for first-order optimality conditions and practical research applications.
Contribution
It clarifies the logical structure of hypotheses in MPECs and guides researchers in model classification, hypothesis verification, and correct analysis.
Findings
Clarifies the logical framework for hypotheses in MPECs
Provides practical guidance for hypothesis verification in research
Enhances understanding of first-order optimality conditions
Abstract
In this workshop, we present a compact but rigorous introduction to the basic language of nonlinear programming, variational inequalities, and complementarity systems. The goal is twofold. First, we explain the mathematical logic of hypotheses under which first-order optimality conditions for MPECs become valid. Second, we explain how to use that theory in research practice: how to classify a model, choose the appropriate verification route, prove the right hypotheses, and derive a correct first-order analysis.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
