Glocal smoothness enables iterate-independent complexity bounds showing line search and adaptive steps outperform fixed steps, with GD+line search sometimes beating accelerated GD.
Thus, aftertδ +( d −1) iterations the algorithm is in in the quadratic region and has already reset so NLCG is equivalent to linear CG
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Glocal Smoothness: Line search and adaptive step sizes can help in theory too!
Glocal smoothness enables iterate-independent complexity bounds showing line search and adaptive steps outperform fixed steps, with GD+line search sometimes beating accelerated GD.