Imagen de Portada

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Rotaru, Teodor, Patrinos, Panagiotis, Glineur, François
Formato:	Preprint
Publicado:	2025
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

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

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

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)

Anisotropic Proximal Gradient
por: Laude, Emanuel, et al.
Publicado: (2022)

Anisotropic Proximal Point Algorithm
por: Laude, Emanuel, et al.
Publicado: (2023)

On the convergence rate of the boosted Difference-of-Convex Algorithm (DCA)
por: Abbaszadehpeivasti, Hadi, et al.
Publicado: (2025)

Global Convergence Analysis of the Power Proximal Point and Augmented Lagrangian Method
por: Oikonomidis, Konstantinos A., et al.
Publicado: (2023)

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

Nonlinearly Preconditioned Gradient Methods: Momentum and Stochastic Analysis
por: Oikonomidis, Konstantinos, et al.
Publicado: (2025)

On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms
por: Kamri, Yassine, et al.
Publicado: (2025)

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

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

Inertial Proximal Difference-of-Convex Algorithm with Convergent Bregman Plug-and-Play for Nonconvex Imaging
por: Chow, Tsz Ching, et al.
Publicado: (2024)

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

Parametric Nonconvex Optimization via Convex Surrogates
por: Wang, Renzi, et al.
Publicado: (2026)

Convergence and Trade-Offs in Riemannian Gradient Descent and Riemannian Proximal Point
por: Martínez-Rubio, David, et al.
Publicado: (2024)

Revisiting Stochastic Gradient Descent for Strongly Convex Objectives: Tight Uniform-in-Time Bounds
por: Chen, Kang, et al.
Publicado: (2025)

Stability of Primal-Dual Gradient Flow Dynamics for Multi-Block Convex Optimization Problems
por: Ozaslan, Ibrahim K., et al.
Publicado: (2024)

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

Convergence Analysis of the Wasserstein Proximal Algorithm beyond Geodesic Convexity
por: Zhu, Shuailong, et al.
Publicado: (2025)

Improved Rates for Stochastic Variance-Reduced Difference-of-Convex Algorithms
por: Nguyen, Anh Duc, et al.
Publicado: (2025)

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

Input-to-State Stability of a Bilevel Proximal Gradient Descent Algorithm
por: Kolmanovsky, Torbjørn Cunis Ilya
Publicado: (2022)

Risk-Sensitive Model Predictive Control for Interaction-Aware Planning -- A Sequential Convexification Algorithm
por: Wang, Renzi, et al.
Publicado: (2025)

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

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

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)

Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence Analysis
por: Kim, Jungbin, et al.
Publicado: (2022)

Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness
por: Oikonomidis, Konstantinos, et al.
Publicado: (2025)

A New Convergence Analysis of Plug-and-Play Proximal Gradient Descent Under Prior Mismatch
por: Xu, Guixian, et al.
Publicado: (2026)

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

A Proximal Descent Method for Minimizing Weakly Convex Optimization
por: Liao, Feng-Yi, et al.
Publicado: (2025)

Learning Provably Improves the Convergence of Gradient Descent
por: Song, Qingyu, et al.
Publicado: (2025)

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

Escaping saddle points without Lipschitz smoothness: the power of nonlinear preconditioning
por: Bodard, Alexander, et al.
Publicado: (2025)

Newton methods beyond Hessian Lipschitz continuity: A nonlinear preconditioning approach
por: Bodard, Alexander, et al.
Publicado: (2026)

Explicit Convergence Rate of The Proximal Point Algorithm under R-Continuity
por: Le, Ba Khiet, et al.
Publicado: (2024)

Gradient Descent for Convex and Smooth Noisy Optimization
por: Hu, Feifei, et al.
Publicado: (2024)

Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
por: Vaidyan, Kevin Kurian Thomas, et al.
Publicado: (2026)

Quantitative Convergence Analysis of Projected Stochastic Gradient Descent for Non-Convex Losses via the Goldstein Subdifferential
por: Zheng, Yuping, et al.
Publicado: (2025)