Convergence Rate Analysis of the Forward-Douglas-Rachford Splitting Scheme

From MaRDI portal
Publication:2947226

DOI10.1137/140992291zbMath1325.65081arXiv1410.2654OpenAlexW1607518970MaRDI QIDQ2947226

Damek Davis

Publication date: 22 September 2015

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.2654




Related Items

A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence ratesUnnamed ItemA New Homotopy Proximal Variable-Metric Framework for Composite Convex MinimizationConvergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point ProblemsConvergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problemFast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}{{ k}} \right)}\)A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex MinimizationA survey on operator splitting and decomposition of convex programsAn adaptive primal-dual framework for nonsmooth convex minimizationProximal alternating penalty algorithms for nonsmooth constrained convex optimizationA three-operator splitting scheme and its optimization applicationsComplexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operatorsModified Fejér sequences and applicationsOver relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methodsNon-stationary First-Order Primal-Dual Algorithms with Faster Convergence RatesConvergence rates of forward-Douglas-Rachford splitting methodAn inertial parallel and asynchronous forward-backward iteration for distributed convex optimizationNon-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergenceIteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions


Uses Software


Cites Work