paper-with-me

Papers

Accelerated forward-backward and Douglas-Rachford splitting dynamics

2024-07-30 · Ibrahim K. Ozaslan, Mihailo R. Jovanović

We examine convergence properties of continuous-time variants of accelerated Forward-Backward (FB) and Douglas-Rachford (DR) splitting algorithms for nonsmooth composite optimization problems. When the objective function is given by the sum of a quadratic and a nonsmooth term, we establish accelerated sublinear and exponential convergence rates for convex and strongly convex problems, respectively. Moreover, for FB splitting dynamics, we demonstrate that accelerated exponential convergence rate carries over to general strongly convex problems. In our Lyapunov-based analysis we exploit the variable-metric gradient interpretations of FB and DR splittings to obtain smooth Lyapunov functions that allow us to establish accelerated convergence rates. We provide computational experiments to demonstrate the merits and the effectiveness of our analysis.

📄 PDF Abstract BibTeX arXiv:2407.20620

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusions

2021-10-15 · Quoc Tran-Dinh, Yang Luo

In this paper, we develop a new type of accelerated algorithms to solve some classes of maximally monotone equations as well as monotone inclusions. Instead of using Nesterov's accelerating approach, our methods rely on …

Vocal Bursts Type Prediction

Bregman Douglas-Rachford Splitting Method

2025-09-10 · Shiqian Ma, Lin Xiao, Renbo Zhao arxiv

In this paper, we propose the Bregman Douglas-Rachford splitting (BDRS) method and its variant Bregman Peaceman-Rachford splitting method for solving maximal monotone inclusion problem. We show that BDRS is equivalent to…

UNLocBoX: A MATLAB convex optimization toolbox for proximal-splitting methods

2014-02-04 · Nathanael Perraudin, Vassilis Kalofolias, David Shuman, Pierre Vandergheynst

Convex optimization is an essential tool for machine learning, as many of its problems can be formulated as minimization problems of specific objective functions. While there is a large variety of algorithms available to…

A Random Block-Coordinate Douglas-Rachford Splitting Method with Low Computational Complexity for Binary Logistic Regression

2017-12-25 · Luis M. Briceno-Arias, Giovanni Chierchia, Emilie Chouzenoux, Jean-Christophe Pesquet

In this paper, we propose a new optimization algorithm for sparse logistic regression based on a stochastic version of the Douglas-Rachford splitting method. Our algorithm sweeps the training set by randomly selecting a …

regression

Gradient flows and proximal splitting methods: A unified view on accelerated and stochastic optimization

2019-08-02 · Guilherme França, Daniel P. Robinson, René Vidal

Optimization is at the heart of machine learning, statistics and many applied scientific disciplines. It also has a long history in physics, ranging from the minimal action principle to finding ground states of disordere…

BIG-bench Machine LearningDistributed OptimizationStochastic Optimization