Introduces AKKT-regularity as the weakest constraint qualification ensuring local optima in continuous-time NLPs satisfy KKT conditions.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Approximate directional stationarity is formulated as a necessary optimality condition for nonsmooth constrained problems, with a qualification condition using one sequence to infer directional stationarity.
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.
-
Approximate directional stationarity and associated qualification conditions
Approximate directional stationarity is formulated as a necessary optimality condition for nonsmooth constrained problems, with a qualification condition using one sequence to infer directional stationarity.