An inexact nonmonotone boosted DC algorithm is shown to converge to critical points under relative-error subproblem tolerances and summable error sequences, with O(1/sqrt(N)) iteration complexity.
Programming Approach to the Multidimensional Scaling Problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
An inexact nonmonotone boosted DC algorithm is shown to converge to critical points under relative-error subproblem tolerances and summable error sequences, with O(1/sqrt(N)) iteration complexity.