Pages that link to "Item:Q2897277"

The following pages link to The Douglas–Rachford Algorithm in the Absence of Convexity (Q2897277):

Displaying 35 items.

• On the order of the operators in the Douglas-Rachford algorithm (Q279805) (← links)
• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem (Q288229) (← links)
• Convergence rates with inexact non-expansive operators (Q312687) (← links)
• Recent results on Douglas-Rachford methods for combinatorial optimization problems (Q467464) (← links)
• Projection methods for quantum channel construction (Q496914) (← links)
• 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)
• The Douglas-Rachford algorithm for the case of the sphere and the line (Q746821) (← links)
• Circumcentering the Douglas-Rachford method (Q1652791) (← links)
• A remark on the convergence of the Douglas-Rachford iteration in a non-convex setting (Q1653319) (← links)
• Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres (Q1653333) (← links)
• A Lyapunov function construction for a non-convex Douglas-Rachford iteration (Q1730763) (← links)
• Constraint reduction reformulations for projection algorithms with applications to wavelet construction (Q2046564) (← links)
• Learning without loss (Q2138443) (← links)
• Circumcentering reflection methods for nonconvex feasibility problems (Q2158827) (← links)
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (Q2189471) (← links)
• A cyclic Douglas-Rachford iteration scheme (Q2250057) (← links)
• Local convergence properties of Douglas-Rachford and alternating direction method of multipliers (Q2397468) (← links)
• The Douglas-Rachford algorithm for a hyperplane and a doubleton (Q2423795) (← links)
• Global convergence of a non-convex Douglas-Rachford iteration (Q2434636) (← links)
• On the circumcentered-reflection method for the convex feasibility problem (Q2661677) (← links)
• New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses (Q2789608) (← links)
• Linear convergence of the Douglas–Rachford method for two closed sets (Q2790885) (← links)
• DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS (Q2925693) (← links)
• Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems (Q2954171) (← links)
• APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS (Q3122033) (← links)
• A Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard Manifolds (Q3188211) (← links)
• Maximum entropy and feasibility methods for convex and nonconvex inverse problems (Q3225065) (← links)
• Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples (Q3298016) (← links)
• Activity Identification and Local Linear Convergence of Douglas–Rachford/ADMM under Partial Smoothness (Q3300345) (← links)
• Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination (Q4557875) (← links)
• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD (Q4992365) (← links)
• A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance (Q5107962) (← links)
• Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions (Q6043138) (← links)
• Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency (Q6130543) (← links)