On weak convergence of the Douglas-Rachford method

DOI10.1137/100788100MaRDI QIDQ2999830zbMATH OpenOpenAlexFDO

Authors B. F. Svaiter

Publication date 17 May 2011

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/100788100

zbMATH Keywords

Douglas-Rachford methodweak convergence

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Nonsmooth analysis (49J52)

Recommendations

• The Douglas-Rachford algorithm converges only weakly
• A simplified proof of weak convergence in Douglas-Rachford method
• On the convergence rate of Douglas-Rachford operator splitting method
• On the order of the operators in the Douglas-Rachford algorithm
• Linear convergence of the Douglas-Rachford method for two closed sets

Cited in

(only showing first 100 items - show all)

• A splitting algorithm for finding fixed points of nonexpansive mappings and solving equilibrium problems
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
• Circumcentering the Douglas-Rachford method
• Solving graph coloring problems with the Douglas-Rachford algorithm
• Two new splitting algorithms for equilibrium problems
• The forward-backward algorithm and the normal problem
• Strong convergence of a splitting proximal projection method for the sum of two maximal monotone operators
• The Douglas-Rachford algorithm in the affine-convex case
• Proximal algorithms for multicomponent image recovery problems
• A hybrid iterative algorithm for solving monotone variational inclusion and hierarchical fixed point problems
• A second-order adaptive Douglas-Rachford dynamic method for maximal \(\alpha\)-monotone operators
• Constraint reduction reformulations for projection algorithms with applications to wavelet construction
• New strong convergence method for the sum of two maximal monotone operators
• Dualize, split, randomize: toward fast nonsmooth optimization algorithms
• Convergence analysis of two-step inertial Douglas-Rachford algorithm and application
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
• Demiclosedness principles for generalized nonexpansive mappings
• Douglas-Rachford splitting algorithm for solving state-dependent maximal monotone inclusions
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
• Projective splitting methods for sums of maximal monotone operators with applications
• Douglas-Rachford splitting for the sum of a Lipschitz continuous and a strongly monotone operator
• A simplified proof of weak convergence in Douglas-Rachford method
• A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
• Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence
• Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions
• A splitting algorithm for system of composite monotone inclusions
• Generalized Krasnoselskii-Mann-type iterations for nonexpansive mappings in Hilbert spaces
• On the Douglas-Rachford algorithm
• A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers
• Least gradient problems with Neumann boundary condition
• Splitting extragradient-like algorithms for strongly pseudomonotone equilibrium problems
• On Douglas-Rachford operators that fail to be proximal mappings
• On the linear convergence of the circumcentered-reflection method
• A parameterized Douglas-Rachford algorithm
• Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm
• Strong convergence of a splitting projection method for the sum of maximal monotone operators
• On the circumcentered-reflection method for the convex feasibility problem
• Construction of quantum states with special properties by projection methods
• A generalized forward-backward splitting operator: degenerate analysis and applications
• Primal-dual splittings as fixed point iterations in the range of linear operators
• New Douglas-Rachford algorithmic structures and their convergence analyses
• Linear convergence of the Douglas-Rachford method for two closed sets
• On the order of the operators in the Douglas-Rachford algorithm
• The Douglas-Rachford algorithm for two (not necessarily intersecting) affine subspaces
• On the finite termination of the Douglas-Rachford method for the convex feasibility problem
• Convergence rate analysis for averaged fixed point iterations in common fixed point problems
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• Application of projection algorithms to differential equations: boundary value problems
• On the range of the Douglas-Rachford operator
• Local linear convergence of the ADMM/Douglas-Rachford algorithms without strong convexity and application to statistical imaging
• Comparing averaged relaxed cutters and projection methods: theory and examples
• A parameterized three-operator splitting algorithm and its expansion
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• A Douglas-Rachford splitting method for solving equilibrium problems
• Attouch-Théra duality revisited: Paramonotonicity and operator splitting
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• Convergence rate analysis of inertial Krasnoselskii-Mann type iteration with applications
• Forward-partial inverse-forward splitting for solving monotone inclusions
• On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint
• On the convergence rate of the Krasnosel'skiĭ-Mann iteration
• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
• Adaptive Douglas--Rachford Splitting Algorithm from a Yosida Approximation Standpoint
• Split-Douglas-Rachford algorithm for composite monotone inclusions and split-ADMM
• A Two-Stage Color Image Segmentation Method Based on Saturation-Value Total Variation
• Asymptotic behaviour of a nonautonomous evolution equation governed by a quasi-nonexpansive operator
• A dynamical splitting method for minimizing the sum of three convex functions
• A splitting method for finding the resolvent of the sum of two maximal monotone operators
• The Douglas-Rachford algorithm converges only weakly
• A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance
• A forward-backward splitting method for monotone inclusions without cocoercivity
• Ergodic behaviour of a Douglas-Rachford operator away from the origin
• Proofs of the stability and convergence of a weakened weak method using PIM shape functions
• Strong convergence theorems by hybrid and shrinking projection methods for sums of two monotone operators
• Adaptive Douglas-Rachford splitting algorithm for the sum of two operators
• Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
• On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
• New demiclosedness principles for (firmly) nonexpansive operators
• Convergence of an Inertial Shadow Douglas-Rachford Splitting Algorithm for Monotone Inclusions
• Degenerate Preconditioned Proximal Point Algorithms
• Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
• Douglas–Rachford algorithm for control-constrained minimum-energy control problems
• Solving monotone inclusions involving the sum of three maximally monotone operators and a cocoercive operator with applications
• The geometry of monotone operator splitting methods
• Equivalent resolvents of Douglas-Rachford splitting and other operator splitting algorithms: a unified degenerate proximal point analysis
• Tikhonov regularized iterative methods for nonlinear problems
• Forward-reflected-backward and shadow-Douglas-Rachford with partial inverse for solving monotone inclusions
• Forward-primal-dual-half-forward algorithm for splitting four operators
• A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
• A three-operator splitting scheme and its optimization applications
• A new projection method for finding the closest point in the intersection of convex sets
• A separate preconditioned primal-dual splitting algorithm for composite monotone inclusion problems
• A general framework for inexact splitting algorithms with relative errors and applications to Chambolle-Pock and Davis-Yin methods
• On degenerate preconditioned proximal point methods under restricted monotonicity
• Accelerated Douglas-Rachford splitting algorithm using neural network
• Convergence of the preconditioned proximal point method and Douglas-Rachford splitting in the absence of monotonicity
• Convergent algorithms for P-area minimizing surfaces in the Heisenberg group
• A primal-dual splitting algorithm with convex combination and larger step sizes for composite monotone inclusion problems
• Frugal and decentralised resolvent splittings defined by nonexpansive operators
• Convergence of the Chambolle-Pock algorithm in the absence of monotonicity
• The degenerate variable metric proximal point algorithm and adaptive stepsizes for primal–dual Douglas–Rachford

This page was built for publication: On weak convergence of the Douglas-Rachford method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999830)