Reformulates SDCMPCC via spectral decomposition of complementarity structure and proves augmented Lagrangian accumulation points are W-stationary (or C-stationary under stricter subproblem conditions).
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces AKKT-regularity as the weakest constraint qualification ensuring local optima in continuous-time NLPs satisfy KKT conditions.
citing papers explorer
-
Augmented Lagrangian methods for nonlinear semidefinite programming with complementarity constraints
Reformulates SDCMPCC via spectral decomposition of complementarity structure and proves augmented Lagrangian accumulation points are W-stationary (or C-stationary under stricter subproblem conditions).
-
A New Constraint Qualification for Continuous-Time Nonlinear Programming Based on Asymptotic KKT Conditions
Introduces AKKT-regularity as the weakest constraint qualification ensuring local optima in continuous-time NLPs satisfy KKT conditions.