A smoothing moving balls approximation method is proposed for difference-of-convex optimization over nonlinear conic constraints, with iteration complexity for approximate KKT points and convergence analysis 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
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A smoothing moving balls approximation method for a class of conic-constrained difference-of-convex optimization problems
A smoothing moving balls approximation method is proposed for difference-of-convex optimization over nonlinear conic constraints, with iteration complexity for approximate KKT points and convergence analysis in the convex case.