Develops a smoothing extension of ESQM for DC optimization over convex composite inequality constraints, proving O(ε^{-3}) iteration complexity to (ε,ε)-KKT points plus convergence in the convex case.
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 smoothing extended sequential quadratic method for difference-of-convex optimization over a convex composite inequality constraint
Develops a smoothing extension of ESQM for DC optimization over convex composite inequality constraints, proving O(ε^{-3}) iteration complexity to (ε,ε)-KKT points plus convergence in the convex case.