On the Douglas-Rachford algorithm

From MaRDI portal
Publication:2364494

DOI10.1007/s10107-016-1086-3OpenAlexW2962916293MaRDI QIDQ2364494

Heinz H. Bauschke, Walaa M. Moursi

Publication date: 21 July 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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




Related Items

Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problemsCircumcentering the Douglas-Rachford methodSolving graph coloring problems with the Douglas-Rachford algorithmDynamics of the Douglas-Rachford method for ellipses and \(p\)-spheresA product space reformulation with reduced dimension for splitting algorithmsUnnamed ItemOn the minimal displacement vector of the Douglas-Rachford operatorOn the circumcentered-reflection method for the convex feasibility problemOn the linear convergence of the circumcentered-reflection methodA parameterized Douglas-Rachford algorithmThe Douglas-Rachford algorithm for convex and nonconvex feasibility problemsComputing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithmThe Douglas-Rachford algorithm for a hyperplane and a doubletonUnrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert spaceDouglas–Rachford algorithm for control-constrained minimum-energy control problemsMathematical modeling of plasma transport in a helical magnetic fieldPrimal-dual splittings as fixed point iterations in the range of linear operatorsThe cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operatorsA nonsmooth Newton method for the design of state feedback stabilizers under structure constraintsOn the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimizationDouglas-Rachford splitting algorithm for solving state-dependent maximal monotone inclusionsStrengthened splitting methods for computing resolventsA Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex settingA new projection method for finding the closest point in the intersection of convex setsGeneral splitting methods with linearization for the split feasibility problemInfeasibility detection in the alternating direction method of multipliers for convex optimizationConvergence analysis of the generalized splitting methods for a class of nonconvex optimization problemsConvex combination of alternating projection and Douglas-Rachford operators for phase retrievalDouglas-Rachford splitting and ADMM for pathological convex optimizationSplitting with Near-Circulant Linear Systems: Applications to Total Variation CT and PETOn the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear ConstraintA new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programsSURVEY: SIXTY YEARS OF DOUGLAS–RACHFORDAdaptive Douglas--Rachford Splitting Algorithm for the Sum of Two OperatorsReflection-based technique for synthesis of structured controllers with guaranteed local convergence


Uses Software


Cites Work