The following pages link to On the Douglas-Rachford algorithm (Q2364494):
Displaying 34 items.
- A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting (Q670659) (← links)
- A new projection method for finding the closest point in the intersection of convex sets (Q683336) (← links)
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems (Q1630271) (← links)
- Circumcentering the Douglas-Rachford method (Q1652791) (← links)
- Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
- Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres (Q1653333) (← links)
- General splitting methods with linearization for the split feasibility problem (Q2022289) (← links)
- Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval (Q2027792) (← links)
- A product space reformulation with reduced dimension for splitting algorithms (Q2162533) (← links)
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (Q2189471) (← links)
- A nonsmooth Newton method for the design of state feedback stabilizers under structure constraints (Q2224776) (← links)
- On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization (Q2230792) (← links)
- Douglas-Rachford splitting algorithm for solving state-dependent maximal monotone inclusions (Q2230801) (← links)
- Strengthened splitting methods for computing resolvents (Q2231047) (← links)
- Infeasibility detection in the alternating direction method of multipliers for convex optimization (Q2275323) (← links)
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems (Q2275326) (← links)
- Douglas-Rachford splitting and ADMM for pathological convex optimization (Q2282817) (← links)
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs (Q2316619) (← links)
- On the linear convergence of the circumcentered-reflection method (Q2417091) (← links)
- A parameterized Douglas-Rachford algorithm (Q2419571) (← links)
- Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm (Q2420809) (← links)
- The Douglas-Rachford algorithm for a hyperplane and a doubleton (Q2423795) (← links)
- On the minimal displacement vector of the Douglas-Rachford operator (Q2661617) (← links)
- On the circumcentered-reflection method for the convex feasibility problem (Q2661677) (← links)
- Mathematical modeling of plasma transport in a helical magnetic field (Q2688480) (← links)
- Primal-dual splittings as fixed point iterations in the range of linear operators (Q2694517) (← links)
- (Q4969143) (← links)
- On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint (Q4971015) (← links)
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD (Q4992365) (← links)
- Reflection-based technique for synthesis of structured controllers with guaranteed local convergence (Q5026637) (← links)
- Splitting with Near-Circulant Linear Systems: Applications to Total Variation CT and PET (Q5214831) (← links)
- Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators (Q5242929) (← links)
- The cyclic Douglas–Rachford algorithm with <i>r</i>-sets-Douglas–Rachford operators (Q5379466) (← links)
- Douglas–Rachford algorithm for control-constrained minimum-energy control problems (Q6151944) (← links)
