Pages that link to "Item:Q2804207"

The following pages link to The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces (Q2804207):

Displaying 23 items.

• On the minimal displacement vector of compositions and convex combinations of nonexpansive mappings (Q827012) (← links)
• Affine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithm (Q1679586) (← links)
• On sums and convex combinations of projectors onto convex sets (Q1740660) (← links)
• The forward-backward algorithm and the normal problem (Q1752641) (← links)
• The magnitude of the minimal displacement vector for compositions and convex combinations of firmly nonexpansive mappings (Q1800437) (← links)
• General splitting methods with linearization for the split feasibility problem (Q2022289) (← links)
• The block-wise circumcentered-reflection method (Q2191785) (← links)
• On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization (Q2230792) (← links)
• Douglas-Rachford splitting for the sum of a Lipschitz continuous and a strongly monotone operator (Q2275277) (← links)
• Infeasibility detection in the alternating direction method of multipliers for convex optimization (Q2275323) (← 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 Douglas-Rachford algorithm (Q2364494) (← links)
• On the linear convergence of the circumcentered-reflection method (Q2417091) (← 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)
• 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)
• Convergence Analysis of the Relaxed Douglas--Rachford Algorithm (Q5217595) (← links)
• Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings (Q5219693) (← links)
• Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming (Q5275290) (← links)
• The Splitting Algorithms by Ryu, by Malitsky–Tam, and by Campoy Applied to Normal Cones of Linear Subspaces Converge Strongly to the Projection onto the Intersection (Q6158002) (← links)
• Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)