An explicit stepsize schedule for quasi-Newton updates achieves O(1/k) global convergence on convex functions, and O(1/k^2) when Hessian approximation error is controlled.
(19) Lemma 4 (Hanzely et al
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
-
Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees
An explicit stepsize schedule for quasi-Newton updates achieves O(1/k) global convergence on convex functions, and O(1/k^2) when Hessian approximation error is controlled.