Finding best approximation pairs relative to two closed convex sets in Hilbert spaces

DOI10.1016/J.JAT.2004.02.006zbMath1050.46021OpenAlexW2166406271MaRDI QIDQ596824

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

Publication date: 10 August 2004

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

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

zbMATH Keywords

weak convergence reflection normal cone Hilbert space projection convex set method of partial inverses best approximation pair firmly nonexpansive map hybrid projection-reflection method

Mathematics Subject Classification ID

Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items (76)

Finding a best approximation pair of points for two polyhedra ⋮ On the Douglas-Rachford algorithm ⋮ The numerics of phase retrieval ⋮ On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces ⋮ The Douglas–Rachford Algorithm in the Absence of Convexity ⋮ Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems ⋮ Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization ⋮ On the Range of the Douglas–Rachford Operator ⋮ Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging ⋮ Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination ⋮ Solving graph coloring problems with the Douglas-Rachford algorithm ⋮ DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS ⋮ Gearhart-Koshy acceleration for affine subspaces ⋮ On the minimal displacement vector of the Douglas-Rachford operator ⋮ FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming ⋮ Minimization of equilibrium problems, variational inequality problems and fixed point problems ⋮ Matrix product constraints by projection methods ⋮ Stochastic alternating projections ⋮ On the linear convergence of the circumcentered-reflection method ⋮ \(n\)-best kernel approximation in reproducing kernel Hilbert spaces ⋮ Linear and strong convergence of algorithms involving averaged nonexpansive operators ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ The Douglas-Rachford algorithm for a hyperplane and a doubleton ⋮ Proximal Activation of Smooth Functions in Splitting Algorithms for Convex Image Recovery ⋮ Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency ⋮ Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems ⋮ Provable Phase Retrieval with Mirror Descent ⋮ AAR-based decomposition algorithm for non-linear convex optimisation ⋮ Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming ⋮ Averaged alternating reflections in geodesic spaces ⋮ Algorithmic approach to a minimization problem ⋮ Attouch-Théra duality revisited: Paramonotonicity and operator splitting ⋮ There is no variational characterization of the cycles in the method of periodic projections ⋮ Local linear convergence of approximate projections onto regularized sets ⋮ Recent results on Douglas-Rachford methods for combinatorial optimization problems ⋮ Searching with iterated maps ⋮ A primal-dual method of partial inverses for composite inclusions ⋮ Fixed Point Analysis of Douglas--Rachford Splitting for Ptychography and Phase Retrieval ⋮ A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting ⋮ On sums and convex combinations of projectors onto convex sets ⋮ Fourier phase retrieval with a single mask by Douglas-Rachford algorithms ⋮ A feasibility approach for constructing combinatorial designs of circulant type ⋮ A cyclic Douglas-Rachford iteration scheme ⋮ The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle ⋮ On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces ⋮ Projective splitting methods for sums of maximal monotone operators with applications ⋮ Compositions and averages of two resolvents: relative geometry of fixed points sets and a partial answer to a question by C.\,Byrne ⋮ Solving monotone inclusions via compositions of nonexpansive averaged operators ⋮ The asymptotic behavior of the composition of two resolvents ⋮ Infeasibility detection in the alternating direction method of multipliers for convex optimization ⋮ A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space ⋮ New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses ⋮ Duality and Convex Programming ⋮ Douglas-Rachford splitting and ADMM for pathological convex optimization ⋮ The Douglas-Rachford algorithm in the affine-convex case ⋮ On the local convergence of the Douglas-Rachford algorithm ⋮ The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces ⋮ Modular proximal optimization for multidimensional total-variation regularization ⋮ Convergence Analysis of the Relaxed Douglas--Rachford Algorithm ⋮ On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint ⋮ Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings ⋮ Norm convergence of realistic projection and reflection methods ⋮ A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs ⋮ Finding best approximation pairs for two intersections of closed convex sets ⋮ On the finite termination of the Douglas-Rachford method for the convex feasibility problem ⋮ Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers ⋮ Active-set Methods for Submodular Minimization Problems ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators ⋮ The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors ⋮ Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging ⋮ Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections ⋮ Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons ⋮ Reflection-based technique for synthesis of structured controllers with guaranteed local convergence ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming

Cites Work

This page was built for publication: Finding best approximation pairs relative to two closed convex sets in Hilbert spaces