Papers › A Globally Convergent Method for Computing B-stationary Points of Mathematical...
A Globally Convergent Method for Computing B-stationary Points of Mathematical Programs with Equilibrium Constraints
Armin Nurkanović, Sven Leyffer
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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 certified by solving a linear program with equilibrium constraints (LPEC) constructed at a given feasible point. The proposed method solves a finite sequence of LPECs, which either certify B-stationarity or provide an active set estimate for the complementarity constraints, along with branch nonlinear programs (BNLPs) obtained by fixing the complementarity active set in the MPEC. In particular, the method proceeds in two phases: the first identifies a feasible BNLP or a stationary point of a constraint infeasibility minimization problem, and the second solves a sequence of BNLPs until a B-stationary point of the MPEC is found. We prove that under the MPEC-MFCQ, the method requires solving only a finite number of BNLPs and LPECs for convergence. Moreover, we show that, unless the current iterate is B-stationary, the combinatorial LPECs need not be solved to optimality. For convergence, it suffices to compute a nonzero feasible point, which in practice often requires solving a single linear program, yielding significant computational savings. Numerical experiments show that the proposed method is more robust and faster than relaxation-based methods and mixed-integer NLP reformulations (which, in contrast to the proposed approach, do not provide a certificate of B-stationarity), even on medium- to large-scale instances.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections