Pages that link to "Item:Q288229"

The following pages link to Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem (Q288229):

Displaying 15 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)
• Circumcentering the Douglas-Rachford method (Q1652791) (← links)
• A remark on the convergence of the Douglas-Rachford iteration in a non-convex setting (Q1653319) (← links)
• Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
• Matrix product constraints by projection methods (Q1675556) (← links)
• A Lyapunov function construction for a non-convex Douglas-Rachford iteration (Q1730763) (← links)
• A feasibility approach for constructing combinatorial designs of circulant type (Q1752612) (← links)
• A unified Douglas-Rachford algorithm for generalized DC programming (Q2114583) (← links)
• An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (Q2176284) (← links)
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (Q2189471) (← 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)
• The Douglas-Rachford algorithm for a hyperplane and a doubleton (Q2423795) (← links)
• Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples (Q3298016) (← links)