The specular gradient method, a variant of the subgradient method, converges root-linearly for 1D convex functions under convexity alone.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Nonsmooth Convex Optimization using the Specular Gradient Method with Root-Linear Convergence
The specular gradient method, a variant of the subgradient method, converges root-linearly for 1D convex functions under convexity alone.