Analytic analysis of the worst-case complexity of the gradient method with exact line search and the Polyak stepsize

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Huang, Ya-Kui, Qi, Hou-Duo
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

A modified Polak-Ribiere-Polyak type conjugate gradient method with two stepsize strategies for vector optimization
by: Bai, Yushan, et al.
Published: (2024)

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
by: Rotaru, Teodor, et al.
Published: (2024)

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
by: Lan, Guanghui, et al.
Published: (2024)

A unified framework for inexact adaptive stepsizes in the gradient methods, the conjugate gradient methods and the quasi-Newton methods for strictly convex quadratic optimization
by: Liu, Zexian
Published: (2026)

Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses
by: Gupta, Shuvomoy Das, et al.
Published: (2023)

About some works of Boris Polyak on convergence of gradient methods and their development
by: Ablaev, Seydamet, et al.
Published: (2023)

Conjugate gradient methods without line search for multiobjective optimization
by: Chen, Wang, et al.
Published: (2023)

Linear programming sensitivity measured by the optimal value worst-case analysis
by: Hladík, Milan
Published: (2023)

Remarks on the Polyak-Lojasiewicz inequality and the convergence of gradient systems
by: de Oliveira, Arthur Castello B., et al.
Published: (2025)

Exact worst-case convergence rates for Douglas--Rachford and Davis--Yin splitting methods
by: Nguyen, Edward Duc Hien, et al.
Published: (2025)

An analytic framework for the multiplicative best-worst method
by: Ratandhara, Harshit, et al.
Published: (2023)

Parameter-free proximal bundle methods with adaptive stepsizes for hybrid convex composite optimization problems
by: Monteiro, Renato D. C., et al.
Published: (2024)

Single spin exact gradients for the optimization of complex pulses and pulse sequences
by: Slad, Stella, et al.
Published: (2025)

Exact Convergence rate of the subgradient method by using Polyak step size
by: Zamani, Moslem, et al.
Published: (2024)

Approximate Bregman proximal gradient algorithm with variable metric Armijo--Wolfe line search
by: Fujiki, Kiwamu, et al.
Published: (2025)

Optimal local linear convergence of Nesterov's accelerated gradient method for $C^2$ functions under the Polyak--Łojasiewicz inequality
by: Feng, Zixu, et al.
Published: (2026)

Polyak Minorant Method for Convex Optimization
by: Devanathan, Nikhil, et al.
Published: (2023)

A three-term Polak-Ribière-Polyak conjugate gradient method for vector optimization
by: Lin, Guangxuan, et al.
Published: (2025)

On the complexity of proximal gradient and proximal gradient-Newton-CG methods for \(\ell_1\)-regularized Optimization
by: Zhu, Hong
Published: (2025)

Taxicab distance based best-worst method for multi-criteria decision-making: An analytical approach
by: Ratandhara, Harshit, et al.
Published: (2024)

Accelerating Level-Value Adjustment for the Polyak Stepsize
by: Liu, Anbang, et al.
Published: (2023)

On the construction of a gradient method of quadratic optimization, optimal from the point of view of minimizing the distance to the exact solution
by: Pletnev, N. V.
Published: (2025)

Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
by: Pinheiro, Maria Eduarda, et al.
Published: (2024)

On the convergence analysis of the decentralized projected gradient descent method
by: Choi, Woocheol, et al.
Published: (2023)

Acceleration for Polyak-Łojasiewicz Functions with a Gradient Aiming Condition
by: Hermant, Julien
Published: (2026)

Adaptive Polyak Stepsize with Level-value Adjustment for Distributed Optimization
by: Ouyang, Chen, et al.
Published: (2026)

Minimum cost network flow with interval capacities: The worst-case scenario
by: Rada, Miroslav, et al.
Published: (2026)

Improved conditional gradient method for the generalized cone order optimization problem on the local sphere
by: Zhou, Li-wen, et al.
Published: (2024)

PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python
by: Goujaud, Baptiste, et al.
Published: (2022)

Robust H2/H-infinity control under stochastic requirements: minimizing conditional value-at-risk instead of worst-case performance
by: Kassarian, Ervan, et al.
Published: (2025)

Prelimit Coupling and Steady-State Convergence of Constant-stepsize Nonsmooth Contractive SA
by: Zhang, Yixuan, et al.
Published: (2024)

On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize
by: Choi, Woocheol, et al.
Published: (2023)

A Robust EDM Optimization Approach for 3D Single-Source Localization with Angle and Range Measurements
by: Zhao, Mingyu, et al.
Published: (2025)

A simple uniformly optimal method without line search for convex optimization
by: Li, Tianjiao, et al.
Published: (2023)

A two-stage search framework for constrained multi-gradient descent
by: Lei, Yuan-Zheng, et al.
Published: (2025)

Polyak Stepsize: Estimating Optimal Functional Values Without Parameters or Prior Knowledge
by: Abdukhakimov, Farshed, et al.
Published: (2025)

New Results on the Polyak Stepsize: Tight Convergence Analysis and Universal Function Classes
by: He, Chang, et al.
Published: (2025)

A technical note on finite best-worst random utility model representations
by: Colonius, Hans
Published: (2024)

A line search framework with restarting for noisy optimization problems
by: Berahas, Albert S., et al.
Published: (2025)

Online Stochastic Gradient Methods Under Sub-Weibull Noise and the Polyak-Łojasiewicz Condition
by: Kim, Seunghyun, et al.
Published: (2021)