CRM initialized in V converges linearly at the sharp rate ρ_V = (sin²θ_p - sin²θ_F)/(sin²θ_p + sin²θ_F) which is optimal for parameter-free single-step methods and smaller than c_F².
Numerical Algorithms 78(3), 759–776 (2018)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2verdicts
UNVERDICTED 2representative citing papers
Investigates Fejér* monotonicity in Hilbert spaces for optimization algorithms, its weak and strong convergence, and comparisons to quasi-Fejér-type notions via examples.
citing papers explorer
-
On the sharp linear convergence rate of the circumcentered--reflection method on subspaces
CRM initialized in V converges linearly at the sharp rate ρ_V = (sin²θ_p - sin²θ_F)/(sin²θ_p + sin²θ_F) which is optimal for parameter-free single-step methods and smaller than c_F².
-
Fej\'er* monotonicity in optimization algorithms
Investigates Fejér* monotonicity in Hilbert spaces for optimization algorithms, its weak and strong convergence, and comparisons to quasi-Fejér-type notions via examples.