A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space

DOI10.1016/j.jat.2006.01.003zbMath1123.41021MaRDI QIDQ2502868

Heinz H. Bauschke, D. Russell Luke, Patrick L. Combettes

Publication date: 13 September 2006

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2006.01.003

zbMATH Keywords

projections; convex sets; best approximation

Mathematics Subject Classification ID

41A50: Best approximation, Chebyshev systems

Related Items

Global convergence of the alternating projection method for the Max-Cut relaxation problem, A parallel subgradient method extended to variational inequalities involving nonexpansive mappings, SOLVING STRONGLY MONOTONE LINEAR COMPLEMENTARITY PROBLEMS, The strong convergence of a three-step algorithm for the split feasibility problem, Attouch-Théra duality revisited: Paramonotonicity and operator splitting, Common solutions to variational inequalities, A new projection method for finding the closest point in the intersection of convex sets, A parallel extragradient-like projection method for unrelated variational inequalities and fixed point problems, A new double-projection method for solving variational inequalities in Banach spaces, On sums and convex combinations of projectors onto convex sets, A new extragradient-type algorithm for the split feasibility problem, Averaged alternating reflections in geodesic spaces, Projective splitting methods for sums of maximal monotone operators with applications, Hybrid shrinking iterative solutions to convex feasibility problems for countable families of relatively nonexpansive mappings and a system of generalized mixed equilibrium problems, A Mann type hybrid generalized \(f\)-projection iterative method for a class of nonlinear mappings, New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses, Best Approximation from the Kuhn-Tucker Set of Composite Monotone Inclusions, The Douglas–Rachford Algorithm in the Absence of Convexity, Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Best approximation in inner product spaces