The method of alternating relaxed projections for two nonconvex sets

DOI10.1007/s10013-013-0049-8zbMath1312.65092arXiv1305.4296OpenAlexW2963283644MaRDI QIDQ484479

Heinz H. Bauschke, Hung M. Phan, Shawn Xianfu Wang

Publication date: 7 January 2015

Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.4296

zbMATH Keywords

numerical examplesnormal conelinear convergenceprojection operatormethod of alternating projectionsfeasibility problemmethod of alternating relaxed projections

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Related Items (8)

Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems ⋮ Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms ⋮ Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning ⋮ Regularity of sets under a reformulation in a product space with reduced dimension ⋮ On the existence of minimizers of proximity functions for split feasibility problems ⋮ Linear convergence of the Douglas–Rachford method for two closed sets ⋮ Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results ⋮ Linear Convergence of Projection Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restricted normal cones and the method of alternating projections: applications
• Restricted normal cones and the method of alternating projections: theory
• Iterative methods for fixed point problems in Hilbert spaces
• Asymptotic behavior of compositions of under-relaxed nonexpansive operators
• Local linear convergence for alternating and averaged nonconvex projections
• The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
• Method of successive projections for finding a common point of sets in metric spaces
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
• On the factorization of matrices
• Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• On Projection Algorithms for Solving Convex Feasibility Problems
• Convex Analysis
• The method of projections for finding the common point of convex sets
• Functional Operators (AM-22), Volume 2
• Convex analysis and monotone operator theory in Hilbert spaces
• Best approximation in inner product spaces

This page was built for publication: The method of alternating relaxed projections for two nonconvex sets