Refined KKT and FJ optimality conditions are derived for nonconvex programs with strongly quasiconvex constraints using the strong subdifferential and its application to the normal cone of the supremum function.
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
-
On Optimality Conditions for Mathematical Programming Problems Based on Strong Subdifferentials
Refined KKT and FJ optimality conditions are derived for nonconvex programs with strongly quasiconvex constraints using the strong subdifferential and its application to the normal cone of the supremum function.