Preprint
Aug 2026
On the Complexity of BFGS Method for Smooth Convex Optimization
A global iteration complexity bound is established for the smallest gradient norm among the first $k$ iterates for the smallest gradient norm among the first $k$ iterates when the initial sublevel set is bounded.
Lijun Ding, Jinwen Yang, Baoyu Zhou
· 0 citations