Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
From MaRDI portal
Publication:3629514
DOI10.1137/070681399zbMath1169.65056OpenAlexW2132509202MaRDI QIDQ3629514
Publication date: 27 May 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070681399
fixed pointprojectionconvex setmaximal monotone mappingprox-regular setbest approximation pairinconsistent feasibility problem
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Set-valued and variational analysis (49J53) Decomposition methods (49M27) Numerical methods of relaxation type (49M20)
Related Items
Finding a best approximation pair of points for two polyhedra ⋮ The numerics of phase retrieval ⋮ Iterative approximation of solutions for proximal split feasibility problems ⋮ Entropic Regularization of the ℓ 0 Function ⋮ Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems ⋮ Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces ⋮ Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems ⋮ Prox-regularity approach to generalized equations and image projection ⋮ Restricted normal cones and the method of alternating projections: applications ⋮ Peaceman-Rachford splitting for a class of nonconvex optimization problems ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Union averaged operators with applications to proximal algorithms for MIN-convex functions ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ Provable Phase Retrieval with Mirror Descent ⋮ Unnamed Item ⋮ Local linear convergence of approximate projections onto regularized sets ⋮ Solving proximal split feasibility problems without prior knowledge of operator norms ⋮ Fixed Point Analysis of Douglas--Rachford Splitting for Ptychography and Phase Retrieval ⋮ The method of alternating relaxed projections for two nonconvex sets ⋮ Forward-partial inverse-forward splitting for solving monotone inclusions ⋮ Compositions and averages of two resolvents: relative geometry of fixed points sets and a partial answer to a question by C.\,Byrne ⋮ Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces ⋮ Duality and Convex Programming ⋮ A convergent relaxation of the Douglas-Rachford algorithm ⋮ Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval ⋮ The Douglas-Rachford algorithm in the affine-convex case ⋮ Phase Retrieval via Matrix Completion ⋮ Convergence Analysis of the Relaxed Douglas--Rachford Algorithm ⋮ Modified viscosity implicit rules for proximal split feasibility and fixed point problems ⋮ Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings ⋮ The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors ⋮ A proximal iterative approach to a non-convex optimization problem ⋮ Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging ⋮ Projection methods for high numerical aperture phase retrieval ⋮ Convergence analysis for proximal split feasibility problems and fixed point problems ⋮ Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons ⋮ Phase Retrieval with Sparse Phase Constraint
