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.
An adjoint-based SQP algorithm with quasi- Newton Jacobian updates for inequality constrained optimization.Optimization Methods and Software, 25(4):531–552
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.