Imagen de Portada

Dictionary-Restricted First-Order Descent Methods: Bounds and Convergence Rates

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Berasategui, Miguel, Berná, Pablo M., Falcó, Antonio
Formato:	Preprint
Publicado:	2026
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

Convergence Rate Bounds for the Mirror Descent Method: IQCs, Popov Criterion and Bregman Divergence
por: Li, Mengmou, et al.
Publicado: (2023)

Convergence of First-Order Algorithms with Momentum from the Perspective of an Inexact Gradient Descent Method
por: Khanh, Pham Duy, et al.
Publicado: (2025)

First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts
por: Li, Mengmou, et al.
Publicado: (2025)

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

Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
por: Alkousa, Mohammad, et al.
Publicado: (2024)

Optimal Local Convergence Rates of Stochastic First-Order Methods under Local $α$-PL
por: Masiha, Saeed, et al.
Publicado: (2024)

Gradient Descent Is Optimal Under Lower Restricted Secant Inequality And Upper Error Bound
por: Guille-Escuret, Charles, et al.
Publicado: (2022)

Perturbed Fenchel Duality and Primal-Dual Convergence of First-Order Methods
por: Zhao, Tiantian
Publicado: (2024)

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

Asymptotic Convergence Analysis of High-Order Proximal-Point Methods Beyond Sublinear Rates
por: Ahookhosh, Masoud, et al.
Publicado: (2025)

Robust Analysis of Almost Sure Convergence of Zeroth-Order Mirror Descent Algorithm
por: Paul, Anik Kumar, et al.
Publicado: (2023)

Global Convergence and Rate Analysis of the Steepest Descent Method for Uncertain Multiobjective Optimization via a Robust Optimization Approach
por: Kumar, Shubham, et al.
Publicado: (2025)

Open Problem: Anytime Convergence Rate of Gradient Descent
por: Kornowski, Guy, et al.
Publicado: (2024)

First and Second Order Approximations to Stochastic Gradient Descent Methods with Momentum Terms
por: Lu, Eric
Publicado: (2025)

First-ish Order Methods: Hessian-aware Scalings of Gradient Descent
por: Smee, Oscar, et al.
Publicado: (2025)

Linear Convergence Rate in Convex Setup is Possible! Gradient Descent Method Variants under $(L_0,L_1)$-Smoothness
por: Lobanov, Aleksandr, et al.
Publicado: (2024)

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

Second-Order Bilevel Optimization with Accelerated Convergence Rates
por: Yang, Sheng, et al.
Publicado: (2026)

A Homogeneous Second-Order Descent Method for Nonconvex Optimization
por: Zhang, Chuwen, et al.
Publicado: (2022)

High Probability Convergence Bounds for Non-convex Stochastic Gradient Descent with Sub-Weibull Noise
por: Madden, Liam, et al.
Publicado: (2020)

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
por: Sherman, Uri, et al.
Publicado: (2025)

Powered Descent Guidance via First-Order Optimization with Expansive Projection
por: Choi, Jiwoo, et al.
Publicado: (2023)

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

An Improved Last-Iterate Convergence Rate for Anchored Gradient Descent Ascent
por: Surina, Anja, et al.
Publicado: (2026)

Convergence Rates for Gradient Descent on the Edge of Stability in Overparametrised Least Squares
por: MacDonald, Lachlan Ewen, et al.
Publicado: (2025)

Multilevel Regularized Newton Methods with Fast Convergence Rates
por: Tsipinakis, Nick, et al.
Publicado: (2024)

First-Order Methods for Linear Programming
por: Lu, Haihao
Publicado: (2024)

Last-Iterate Convergence of Anchored Gradient Descent
por: Cai, Yang, et al.
Publicado: (2026)

Homogeneous Second-Order Descent Framework: A Fast Alternative to Newton-Type Methods
por: He, Chang, et al.
Publicado: (2023)

Convergence Rate Analysis for Monotone Accelerated Proximal Gradient Method
por: Wang, Zepeng, et al.
Publicado: (2025)

On Convergence of the Iteratively Preconditioned Gradient-Descent (IPG) Observer
por: Chakrabarti, Kushal, et al.
Publicado: (2024)

First Order Algorithm on an Optimization Problem with Improved Convergence when Problem is Convex
por: Sim, Chee-Khian
Publicado: (2025)

Distributed Nonconvex Optimization with Exponential Convergence Rate via Hybrid Systems Methods
por: Hendrickson, Katherine R., et al.
Publicado: (2025)

Block Coordinate Descent Methods for Structured Nonconvex Optimization with Nonseparable Constraints: Optimality Conditions and Global Convergence
por: Yuan, Zhijie, et al.
Publicado: (2024)

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

Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods
por: Feng, Yasong, et al.
Publicado: (2025)

INTHOP: A Second-Order Globally Convergent Method for Nonconvex Optimization
por: Kumar, Krishan, et al.
Publicado: (2025)

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

Efficient First Order Method for Saddle Point Problems with Higher Order Smoothness
por: Wang, Nuozhou, et al.
Publicado: (2023)

Verification of First-Order Methods for Parametric Quadratic Optimization
por: Ranjan, Vinit, et al.
Publicado: (2024)