Non-asymptotic Global Convergence Rates of BFGS with Exact Line Search

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jin, Qiujiang, Jiang, Ruichen, Mokhtari, Aryan
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Non-asymptotic Global Convergence Analysis of BFGS with the Armijo-Wolfe Line Search
by: Jin, Qiujiang, et al.
Published: (2024)

Affine-Invariant Global Non-Asymptotic Convergence Analysis of BFGS under Self-Concordance
by: Jin, Qiujiang, et al.
Published: (2025)

Online Learning Guided Quasi-Newton Methods with Global Non-Asymptotic Convergence
by: Jiang, Ruichen, et al.
Published: (2024)

Statistical and Computational Complexities of BFGS Quasi-Newton Method for Generalized Linear Models
by: Jin, Qiujiang, et al.
Published: (2022)

Explicit Global Convergence Rates of BFGS without Line Search
by: Yu, Jianjiang, et al.
Published: (2025)

Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

Online Learning-guided Learning Rate Adaptation via Gradient Alignment
by: Jiang, Ruichen, et al.
Published: (2025)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

Krylov Cubic Regularized Newton: A Subspace Second-Order Method with Dimension-Free Convergence Rate
by: Jiang, Ruichen, et al.
Published: (2024)

Stochastic Newton Proximal Extragradient Method
by: Jiang, Ruichen, et al.
Published: (2024)

Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods
by: Jiang, Ruichen, et al.
Published: (2024)

Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism
by: Patitucci, Francisco, et al.
Published: (2025)

An Inexact Conditional Gradient Method for Constrained Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2023)

Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
by: Jiang, Ruichen, et al.
Published: (2022)

Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization
by: Jiang, Ruichen, et al.
Published: (2026)

An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
by: Cao, Jincheng, et al.
Published: (2024)

On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
by: Cao, Jincheng, et al.
Published: (2025)

Global Complexity Analysis of BFGS
by: Rodomanov, Anton
Published: (2024)

The Essential Best and Average Rate of Convergence of the Exact Line Search Gradient Descent Method
by: Yu, Thomas
Published: (2023)

Adaptive Optimization via Momentum on Variance-Normalized Gradients
by: Patitucci, Francisco, et al.
Published: (2026)

Non-Parametric Learning of Stochastic Differential Equations with Non-asymptotic Fast Rates of Convergence
by: Bonalli, Riccardo, et al.
Published: (2023)

Global Convergence of a Line-Search Filter Differential Dynamic Programming Method
by: Xu, Ming, et al.
Published: (2026)

Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
by: Prudente, L. F., et al.
Published: (2023)

A Proof of the Exact Convergence Rate of Gradient Descent
by: Kim, Jungbin
Published: (2024)

Greedy Newton: Newton's Method with Exact Line Search
by: Shea, Betty, et al.
Published: (2024)

Adaptive SGD with Line-Search and Polyak Stepsizes: Nonconvex Convergence and Accelerated Rates
by: Wu, Haotian
Published: (2025)

Decentralized Conjugate Gradient and Memoryless BFGS Methods
by: Wang, Liping, et al.
Published: (2024)

Modified Line Search Sequential Quadratic Methods for Equality-Constrained Optimization with Unified Global and Local Convergence Guarantees
by: Berahas, Albert S., et al.
Published: (2024)

Efficient Stochastic BFGS methods Inspired by Bayesian Principles
by: Carlon, André, et al.
Published: (2025)

Global convergence of a modified BFGS-type method based on function information for nonconvex multiobjective optimization problems
by: Yang, Yingxue
Published: (2024)

A robust BFGS algorithm for unconstrained nonlinear optimization problems
by: Yang, Yaguang
Published: (2012)

A Fundamental Convergence Rate Bound for Gradient Based Online Optimization Algorithms with Exact Tracking
by: Wu, Alex Xinting, et al.
Published: (2025)

A Diagonal BFGS Update Algorithm with Inertia Acceleration Technology for Minimizations
by: Luo, Zhenhua, et al.
Published: (2024)

On the Convergence Rate of the One-Hop Transfer Algorithm
by: Jiang, Ruichao, et al.
Published: (2026)

Almost Sure Convergence and Non-asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm
by: Paul, Anik Kumar, et al.
Published: (2024)

LeAP-SSN: A Semismooth Newton Method with Global Convergence Rates
by: Alphonse, Amal, et al.
Published: (2025)

Global Convergence of Control-Based Lagrangian Flows for Non-Convex Optimization
by: Pirrera, Simone, et al.
Published: (2026)

On the Crucial Role of Initialization for Matrix Factorization
by: Li, Bingcong, et al.
Published: (2024)

Distributed Adaptive Time-Varying Optimization with Global Asymptotic Convergence
by: Jiang, Liangze, et al.
Published: (2024)

A Non-Monotone Line-Search Method for Minimizing Functions with Spurious Local Minima
by: Aminifard, Zohreh, et al.
Published: (2025)