Pages that link to "Item:Q2790885"

The following pages link to Linear convergence of the Douglas–Rachford method for two closed sets (Q2790885):

Displaying 47 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)
• On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces (Q288232) (← links)
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems (Q312683) (← links)
• Regularity properties of non-negative sparsity sets (Q342902) (← 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)
• A convergent relaxation of the Douglas-Rachford algorithm (Q721957) (← links)
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems (Q1630271) (← 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)
• Tight global linear convergence rate bounds for Douglas-Rachford splitting (Q1684840) (← links)
• The Glowinski-Le Tallec splitting method revisited in the framework of equilibrium problems in Hilbert spaces (Q1702875) (← links)
• A Lyapunov function construction for a non-convex Douglas-Rachford iteration (Q1730763) (← links)
• Orbital geometry and group majorisation in optimisation (Q2022435) (← links)
• Constraint reduction reformulations for projection algorithms with applications to wavelet construction (Q2046564) (← links)
• Alternating projections with applications to Gerchberg-Saxton error reduction (Q2070399) (← links)
• Convergence analysis of two-step inertial Douglas-Rachford algorithm and application (Q2142498) (← links)
• Some new characterizations of intrinsic transversality in Hilbert spaces (Q2174919) (← 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)
• A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization (Q2245040) (← links)
• Douglas-Rachford splitting for the sum of a Lipschitz continuous and a strongly monotone operator (Q2275277) (← links)
• Necessary conditions for linear convergence of iterated expansive, set-valued mappings (Q2297639) (← links)
• Local convergence properties of Douglas-Rachford and alternating direction method of multipliers (Q2397468) (← links)
• Set regularities and feasibility problems (Q2413089) (← links)
• The Douglas-Rachford algorithm for a hyperplane and a doubleton (Q2423795) (← links)
• On the circumcentered-reflection method for the convex feasibility problem (Q2661677) (← links)
• Construction of quantum states with special properties by projection methods (Q2684277) (← 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)
• Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging (Q3188209) (← links)
• On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery (Q4559404) (← links)
• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD (Q4992365) (← links)
• Toward a Mathematical Theory of the Crystallographic Phase Retrieval Problem (Q5027012) (← links)
• Asymptotic behaviour of a nonautonomous evolution equation governed by a quasi-nonexpansive operator (Q5055300) (← links)
• Ergodic behaviour of a Douglas-Rachford operator away from the origin (Q5142536) (← links)
• Convergence Analysis of the Relaxed Douglas--Rachford Algorithm (Q5217595) (← links)
• Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings (Q5219693) (← links)
• Linear Convergence of Projection Algorithms (Q5219736) (← links)
• Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators (Q5242929) (← 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)
• Regularity of sets under a reformulation in a product space with reduced dimension (Q6141904) (← links)
• Provable Phase Retrieval with Mirror Descent (Q6168333) (← links)