SQPCC converges locally to S-stationary points of MPCCs under weaker second-order sufficient conditions, without upper-level strict complementarity, and with active-set identification results.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.OC 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
CCOpt implements coupled relaxation-penalty and interior-point algorithms for MPCCs, delivering substantial speedups on MacMPEC benchmarks and large-scale applications like security-constrained optimal power flow.
New real-time hybrid MPC schemes solve QPCCs per sample to yield bounded-error piecewise affine approximations to discontinuous MPC feedback laws for systems with switches.
citing papers explorer
-
Local Convergence Results for Sequential Quadratic Programming with Complementarity Constraints
SQPCC converges locally to S-stationary points of MPCCs under weaker second-order sufficient conditions, without upper-level strict complementarity, and with active-set identification results.
-
CCOpt: an Open-Source Solver for Large-Scale Mathematical Programs with Complementarity Constraints
CCOpt implements coupled relaxation-penalty and interior-point algorithms for MPCCs, delivering substantial speedups on MacMPEC benchmarks and large-scale applications like security-constrained optimal power flow.
-
Real-Time Algorithms for Model Predictive Control of Hybrid Dynamical Systems
New real-time hybrid MPC schemes solve QPCCs per sample to yield bounded-error piecewise affine approximations to discontinuous MPC feedback laws for systems with switches.