Paperlane

no. 7 · Tuesday 3 November 2026

Piecewise M-Stationarity and Convergence of a Bounding Algorithm for Mathematical Programs with Complementarity Constraints

Kexin Wang and Lorenz T. Biegler

math.OC · v4

Abstract

This study explores B-stationarity condition for mathematical programs with complementarity constraints (MPCCs) and convergence of a Bounding Algorithm we proposed in [33]. Special attention is given to the cases with biactive complementarity constraints. First, we introduce the concept of piecewise M-stationarity and prove its equivalence to B-stationarity under MPCC-GCQ. Then, this concept is employed to propose a simplified B-stationarity verifica- tion. Finally, we investigate improved convergence properties of the Bounding Algorithm in [33]. Limit points of this method are shown to be C-stationary, based on the stationarity of an approaching sequence; moreover, they are piece-wise M-stationary (and therefore B-stationary), if an additional second-order condition is satisfied by the sequence.

fields
Optimization and Control
pdf ↗ page arXiv:2603.23389 ↗