On the convergence rate of the three operator splitting scheme

10/25/2016
by   Fabian Pedregosa, et al.
0

The three operator splitting scheme was recently proposed by [Davis and Yin, 2015] as a method to optimize composite objective functions with one convex smooth term and two convex (possibly non-smooth) terms for which we have access to their proximity operator. In this short note we provide an alternative proof for the sublinear rate of convergence of this method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/06/2018

Adaptive Three Operator Splitting

We propose and analyze a novel adaptive step size variant of the Davis-Y...
research
09/05/2022

DISA: A Dual Inexact Splitting Algorithm for Distributed Convex Composite Optimization

This paper proposes a novel dual inexact splitting algorithm (DISA) for ...
research
02/25/2020

Distributed Algorithms for Composite Optimization: Unified Framework and Convergence Analysis

We study distributed composite optimization over networks: agents minimi...
research
02/25/2020

Distributed Algorithms for Composite Optimization: Unified and Tight Convergence Analysis

We study distributed composite optimization over networks: agents minimi...
research
12/22/2022

Convergence of particles and tree based scheme for singular FBSDEs

We study an implementation of the theoretical splitting scheme introduce...
research
02/08/2016

A Simple Practical Accelerated Method for Finite Sums

We describe a novel optimization method for finite sums (such as empiric...
research
03/15/2023

A Bisection Method to Solve The Elvis Problem With Convex Bounded Velocity Sets

The Elvis problem has been studied in [2], which proves existence of sol...

Please sign up or login with your details

Forgot password? Click here to reset