Compact R-continuity, equivalent to closed-graph behavior at a point, guarantees that R-class algorithms with bounded iterates converge to the solution set of an inclusion.
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
-
Compact R-Continuity with Applications to Solving Inclusions and Convergence of Algorithms
Compact R-continuity, equivalent to closed-graph behavior at a point, guarantees that R-class algorithms with bounded iterates converge to the solution set of an inclusion.