Introduces AKKT-regularity as the weakest constraint qualification ensuring local optima in continuous-time NLPs satisfy KKT conditions.
Title resolution pending
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
-
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.