Pages that link to "Item:Q467464"

The following pages link to Recent results on Douglas-Rachford methods for combinatorial optimization problems (Q467464):

Displaying 33 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)
• Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces (Q312177) (← links)
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems (Q312683) (← links)
• Projection methods for quantum channel construction (Q496914) (← 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)
• Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
• Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres (Q1653333) (← links)
• Matrix product constraints by projection methods (Q1675556) (← links)
• Convergence analysis of processes with valiant projection operators in Hilbert space (Q1706406) (← 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)
• General splitting methods with linearization for the split feasibility problem (Q2022289) (← links)
• Constraint reduction reformulations for projection algorithms with applications to wavelet construction (Q2046564) (← links)
• Circumcentering reflection methods for nonconvex feasibility problems (Q2158827) (← links)
• A product space reformulation with reduced dimension for splitting algorithms (Q2162533) (← 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)
• The block-wise circumcentered-reflection method (Q2191785) (← links)
• A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization (Q2245040) (← links)
• A cyclic Douglas-Rachford iteration scheme (Q2250057) (← links)
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle (Q2252928) (← links)
• Iteration process for fixed point problems and zeros of maximal monotone operators (Q2338025) (← links)
• On the Douglas-Rachford algorithm (Q2364494) (← links)
• On the linear convergence of the circumcentered-reflection method (Q2417091) (← links)
• New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses (Q2789608) (← 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)
• Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples (Q3298016) (← links)
• A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance (Q5107962) (← links)
• Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency (Q6130543) (← links)