Pages that link to "Item:Q596824"

The following pages link to Finding best approximation pairs relative to two closed convex sets in Hilbert spaces (Q596824):

Displaying 50 items.

• On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces (Q288232) (← links)
• Linear and strong convergence of algorithms involving averaged nonexpansive operators (Q401327) (← links)
• Algorithmic approach to a minimization problem (Q448663) (← links)
• Attouch-Théra duality revisited: Paramonotonicity and operator splitting (Q452068) (← links)
• Recent results on Douglas-Rachford methods for combinatorial optimization problems (Q467464) (← links)
• A primal-dual method of partial inverses for composite inclusions (Q479258) (← links)
• Compositions and averages of two resolvents: relative geometry of fixed points sets and a partial answer to a question by C.\,Byrne (Q548635) (← links)
• Minimization of equilibrium problems, variational inequality problems and fixed point problems (Q604954) (← links)
• There is no variational characterization of the cycles in the method of periodic projections (Q652441) (← links)
• Local linear convergence of approximate projections onto regularized sets (Q654094) (← links)
• A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting (Q670659) (← links)
• The asymptotic behavior of the composition of two resolvents (Q707223) (← links)
• AAR-based decomposition algorithm for non-linear convex optimisation (Q902092) (← links)
• Finding a best approximation pair of points for two polyhedra (Q1616942) (← links)
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems (Q1630271) (← links)
• Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization (Q1645274) (← links)
• Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
• Matrix product constraints by projection methods (Q1675556) (← links)
• On sums and convex combinations of projectors onto convex sets (Q1740660) (← links)
• Fourier phase retrieval with a single mask by Douglas-Rachford algorithms (Q1742821) (← links)
• A feasibility approach for constructing combinatorial designs of circulant type (Q1752612) (← links)
• The Douglas-Rachford algorithm in the affine-convex case (Q1790199) (← links)
• Stochastic alternating projections (Q1928866) (← links)
• Averaged alternating reflections in geodesic spaces (Q1947318) (← links)
• Finding best approximation pairs for two intersections of closed convex sets (Q2070342) (← links)
• The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors (Q2084269) (← links)
• FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming (Q2173976) (← links)
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (Q2189471) (← 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)
• Projective splitting methods for sums of maximal monotone operators with applications (Q2257570) (← links)
• Infeasibility detection in the alternating direction method of multipliers for convex optimization (Q2275323) (← links)
• Douglas-Rachford splitting and ADMM for pathological convex optimization (Q2282817) (← links)
• A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs (Q2316619) (← links)
• On the Douglas-Rachford algorithm (Q2364494) (← links)
• On the linear convergence of the circumcentered-reflection method (Q2417091) (← links)
• The Douglas-Rachford algorithm for a hyperplane and a doubleton (Q2423795) (← links)
• A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space (Q2502868) (← links)
• On the local convergence of the Douglas-Rachford algorithm (Q2510692) (← links)
• Gearhart-Koshy acceleration for affine subspaces (Q2661608) (← links)
• On the minimal displacement vector of the Douglas-Rachford operator (Q2661617) (← links)
• New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses (Q2789608) (← links)
• Duality and Convex Programming (Q2789804) (← links)
• The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces (Q2804207) (← links)
• On the finite termination of the Douglas-Rachford method for the convex feasibility problem (Q2836088) (← links)
• The Douglas–Rachford Algorithm in the Absence of Convexity (Q2897277) (← 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)
• On the Range of the Douglas–Rachford Operator (Q3186532) (← links)
• Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging (Q3188209) (← links)