Pages that link to "Item:Q2925693"

The following pages link to DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS (Q2925693):

Displaying 28 items.

• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem (Q288229) (← links)
• Anderson acceleration of the alternating projections method for computing the nearest correlation matrix (Q306368) (← links)
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems (Q312683) (← links)
• Regularity properties of non-negative sparsity sets (Q342902) (← links)
• Recent results on Douglas-Rachford methods for combinatorial optimization problems (Q467464) (← links)
• A new projection method for finding the closest point in the intersection of convex sets (Q683336) (← 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)
• Convergence analysis of processes with valiant projection operators in Hilbert space (Q1706406) (← links)
• A feasibility approach for constructing combinatorial designs of circulant type (Q1752612) (← links)
• Constraint reduction reformulations for projection algorithms with applications to wavelet construction (Q2046564) (← links)
• On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
• Circumcentering reflection methods for nonconvex feasibility problems (Q2158827) (← 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)
• Strengthened splitting methods for computing resolvents (Q2231047) (← links)
• Douglas-Rachford splitting and ADMM for pathological convex optimization (Q2282817) (← links)
• A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing (Q2405990) (← links)
• On the linear convergence of the circumcentered-reflection method (Q2417091) (← links)
• Geometric search for Hadamard matrices (Q2420569) (← links)
• An envelope for Davis-Yin splitting and strict saddle-point avoidance (Q2420798) (← 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)
• ITERATIVE PROJECTION AND REFLECTION METHODS: THEORY AND PRACTICE (Q3186398) (← links)
• Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples (Q3298016) (← links)
• Douglas–Rachford algorithm for control-constrained minimum-energy control problems (Q6151944) (← links)
• Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems (Q6173957) (← links)