A new contractive difference-of-convex algorithm solves each subproblem by Picard iteration of a contraction with an adaptive termination rule, and provably converges to critical points.
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
CONDITIONAL 1representative citing papers
citing papers explorer
-
Contractive difference-of-convex algorithms
A new contractive difference-of-convex algorithm solves each subproblem by Picard iteration of a contraction with an adaptive termination rule, and provably converges to critical points.