Imagen de Portada

Exact Convergence rate of the subgradient method by using Polyak step size

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zamani, Moslem, Glineur, François
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Set of Possible Minimizers of a Sum of Convex Functions
por: Zamani, Moslem, et al.
Publicado: (2024)

Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization
por: Vernimmen, Pierre, et al.
Publicado: (2025)

On the convergence rate of the Douglas-Rachford splitting algorithm
por: Abbaszadehpeivasti, Hadi, et al.
Publicado: (2025)

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

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
por: Rotaru, Teodor, et al.
Publicado: (2025)

Improved convergence rates for the Difference-of-Convex algorithm
por: Rotaru, Teodor, et al.
Publicado: (2024)

Proximal gradient methods with inexact oracle of degree q for composite optimization
por: Nabou, Yassine, et al.
Publicado: (2024)

Tight Convergence Rates in Gradient Mapping for the Difference-of-Convex Algorithm
por: Rotaru, Teodor, et al.
Publicado: (2025)

Dynamics of SGD with Stochastic Polyak Stepsizes: Truly Adaptive Variants and Convergence to Exact Solution
por: Orvieto, Antonio, et al.
Publicado: (2022)

Worst-case convergence analysis of relatively inexact gradient descent on smooth convex functions
por: Vernimmen, Pierre, et al.
Publicado: (2025)

Global minimization of a minimum of a finite collection of functions
por: Van Dessel, Guillaume, et al.
Publicado: (2024)

Global and local approaches for the minimization of a sum of pointwise minima of convex functions
por: Van Dessel, Guillaume, et al.
Publicado: (2025)

Presolve techniques for quasi-convex chance constraints with finite-support low-dimensional uncertainty
por: Van Dessel, Guillaume, et al.
Publicado: (2025)

Sparse Polyak: an adaptive step size rule for high-dimensional M-estimation
por: Qiao, Tianqi, et al.
Publicado: (2025)

Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance
por: Oikonomou, Dimitris, et al.
Publicado: (2024)

Convergence rates of stochastic gradient method with independent sequences of step-size and momentum weight
por: Hwang, Wen-Liang
Publicado: (2024)

On Busemann subgradient methods for stochastic minimization in Hadamard spaces
por: Pischke, Nicholas
Publicado: (2026)

Convergence of empirical subgradients for optimal transport-based objectives
por: Le, Tam
Publicado: (2026)

Inexact subgradient methods for semialgebraic functions
por: Bolte, Jérôme, et al.
Publicado: (2024)

Dual first-order methods for efficient computation of convex hull prices
por: Tanji, Sofiane, et al.
Publicado: (2025)

Are Convex Optimization Curves Convex?
por: Barzilai, Guy, et al.
Publicado: (2025)

On convergence rates of subgradient descent on semialgebraic functions
por: Chzhen, Evgenii, et al.
Publicado: (2026)

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

Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization
por: Guigues, Vincent, et al.
Publicado: (2024)

Stochastic subgradient for composite optimization with functional constraints
por: Necoara, Ion, et al.
Publicado: (2022)

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

Quantized Distributed Nonconvex Optimization Algorithms with Linear Convergence under the Polyak--$Ł$ojasiewicz Condition
por: Xu, Lei, et al.
Publicado: (2022)

Comparison of Proximal First-Order Primal and Primal-Dual algorithms via Performance Estimation
por: Bousselmi, Nizar, et al.
Publicado: (2024)

Conic-Optimization Based Algorithms for Nonnegative Matrix Factorization
por: Leplat, Valentin, et al.
Publicado: (2021)

Linear Convergence of the Proximal Gradient Method for Composite Optimization Under the Polyak-Łojasiewicz Inequality and Its Variant
por: Kong, Qingyuan, et al.
Publicado: (2024)

Mini-batch stochastic subgradient for functional constrained optimization
por: Singh, Nitesh Kumar, et al.
Publicado: (2024)

A self-adaptive subgradient extragradient method with conjugate gradient-type direction for pseudomonotone variational inequalities
por: Arzuka, Ibrahim, et al.
Publicado: (2025)

Hybrid subgradient and simulated annealing method for hemivariational inequalities
por: Bartman-Szwarc, Piotr, et al.
Publicado: (2025)

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

Random minibatch subgradient algorithms for convex problems with functional constraints
por: Nedich, Angelia, et al.
Publicado: (2019)

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

Numerical Design of Optimized First-Order Algorithms
por: Kamri, Yassine, et al.
Publicado: (2025)

Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs
por: Daudin, Samuel, et al.
Publicado: (2025)

On the Convex Interpolation for Linear Operators
por: Bousselmi, Nizar, et al.
Publicado: (2025)

Convergence towards a local minimum by direct search methods with a covering step
por: Audet, Charles, et al.
Publicado: (2024)