Answers are grounded in this paper and cite their sources.
Algorithm analysis demonstrates an adaptive accelerated gradient method achieves fast convergence without line searches, indicating high computational efficiency.
We propose an adaptive accelerated gradient method for solving smooth convex optimization problems. The method incorporates a scheme to determine the step size adaptively, by means of a local estimation of the smoothness constant, which is assumed unknown, without resorting to line search procedures. The sequence generated by this method converges weakly to a minimizer of the objective function, and the function values converge at a fast rate of O( 1/k² ) O 1 k 2 . Moreover, if the objective function is strongly convex, the function values converge at a linear rate O( 1/k²(1-ρ )ᵏ ) O 1 k 2 ( 1 - ρ ) k , with ρ =O( μ /L ) ρ = O μ L , without knowledge of the strong convexity parameter.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: