Pages that link to "Item:Q2252928"

The following pages link to The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle (Q2252928):

Displaying 50 items.

• On the order of the operators in the Douglas-Rachford algorithm (Q279805) (← links)
• On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces (Q288232) (← links)
• Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces (Q312177) (← links)
• Convergence rates with inexact non-expansive operators (Q312687) (← links)
• Linear and strong convergence of algorithms involving averaged nonexpansive operators (Q401327) (← links)
• A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting (Q670659) (← links)
• A three-operator splitting scheme and its optimization applications (Q683303) (← links)
• A new projection method for finding the closest point in the intersection of convex sets (Q683336) (← links)
• Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators (Q721953) (← links)
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems (Q1630271) (← links)
• Circumcentering the Douglas-Rachford method (Q1652791) (← links)
• Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres (Q1653333) (← links)
• Affine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithm (Q1679586) (← links)
• Tight global linear convergence rate bounds for Douglas-Rachford splitting (Q1684840) (← links)
• A Lyapunov function construction for a non-convex Douglas-Rachford iteration (Q1730763) (← links)
• Fourier phase retrieval with a single mask by Douglas-Rachford algorithms (Q1742821) (← links)
• On the linear convergence of circumcentered isometry methods (Q2021771) (← links)
• Circumcentered methods induced by isometries (Q2022432) (← links)
• Error bounds for the method of simultaneous projections with infinitely many subspaces (Q2054274) (← links)
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (Q2189471) (← links)
• The block-wise circumcentered-reflection method (Q2191785) (← links)
• Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces (Q2274154) (← links)
• Douglas-Rachford splitting for the sum of a Lipschitz continuous and a strongly monotone operator (Q2275277) (← links)
• Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis (Q2311982) (← links)
• On the Douglas-Rachford algorithm (Q2364494) (← links)
• Local convergence properties of Douglas-Rachford and alternating direction method of multipliers (Q2397468) (← links)
• On the linear convergence of the circumcentered-reflection method (Q2417091) (← links)
• On the circumcentered-reflection method for the convex feasibility problem (Q2661677) (← links)
• Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem (Q2679568) (← links)
• Linear convergence of the Douglas–Rachford method for two closed sets (Q2790885) (← links)
• The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces (Q2804207) (← links)
• Convergence Rate Analysis of the Forward-Douglas-Rachford Splitting Scheme (Q2947226) (← links)
• Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems (Q2954171) (← links)
• Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging (Q3188209) (← links)
• Fixed Point Analysis of Douglas--Rachford Splitting for Ptychography and Phase Retrieval (Q3296458) (← links)
• Activity Identification and Local Linear Convergence of Douglas–Rachford/ADMM under Partial Smoothness (Q3300345) (← links)
• Sensitivity Analysis for Mirror-Stratifiable Convex Functions (Q4554065) (← links)
• Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination (Q4557875) (← links)
• Norm convergence of realistic projection and reflection methods (Q4981851) (← links)
• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD (Q4992365) (← links)
• Reflection-based technique for synthesis of structured controllers with guaranteed local convergence (Q5026637) (← links)
• Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming (Q5275290) (← links)
• On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces (Q5737718) (← links)
• Local linear convergence analysis of Primal–Dual splitting methods (Q5745166) (← links)
• Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions (Q6043138) (← links)
• Polynomial estimates for the method of cyclic projections in Hilbert spaces (Q6076936) (← links)
• On the centralization of the circumcentered-reflection method (Q6126653) (← links)
• Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency (Q6130543) (← links)
• Comparing the methods of alternating and simultaneous projections for two subspaces (Q6146685) (← 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)