arXiv (All)
open access
A Globally Convergent Method for Computing B-stationary Points of Mathematical Programs with Equilibrium Constraints
This paper introduces a computationally efficient method that converges globally to B-stationary points of mathematical programs with equilibrium constraints (MPECs). B-stationarity is necessary for optimality and means that no feasible first-order direction can improve the objective. It can be cert
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- BACI-VI-Bench: A dataset of variational inequality benchmark instances for multi-agent trade-network equilibrium.#334768
- A dual-active-set algorithm for positive semi-definite quadratic programming#429998
- Primal Methods for Constrained Variational Inequalities: Optimal Rates, Feasibility Trade-offs, and Lower Bounds#1117693
- Nonlinear Programming#465961
- Nonlinear Programming#67029
Record · ID 984826
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive