Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rotaru, Teodor, Patrinos, Panagiotis, Glineur, François
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Improved convergence rates for the Difference-of-Convex algorithm
by: Rotaru, Teodor, 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)

Anisotropic Proximal Gradient
by: Laude, Emanuel, et al.
Published: (2022)

Anisotropic Proximal Point Algorithm
by: Laude, Emanuel, et al.
Published: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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