The method of alternating relaxed projections for two nonconvex sets

DOI10.1007/S10013-013-0049-8zbMATH Open1312.65092arXiv1305.4296OpenAlexW2963283644MaRDI QIDQ484479FDOQ484479

Authors: Heinz H. Bauschke, Hung M. Phan, Xianfu Wang 

Publication date: 7 January 2015

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

Abstract: The Method of Alternating Projections (MAP), a classical algorithm for solving feasibility prob- lems, has recently been intensely studied for nonconvex sets. However, intrinsically available are only local convergence results: convergence occurs if the starting point is not too far away from solutions to avoid getting trapped in certain regions. Instead of taking full projection steps, it can be advantageous to underrelax, i.e., to move only part way towards the constraint set, in order to enlarge the regions of convergence. In this paper, we thus systematically study the Method of Alternating Relaxed Projections (MARP) for two (possibly nonconvex) sets. Complementing our recent work on MAP, we es- tablish local linear convergence results for the MARP. Several examples illustrate our analysis.

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

Recommendations

• Restricted normal cones and the method of alternating projections: applications
• Transversality and alternating projections for nonconvex sets
• Local linear convergence for inexact alternating projections on nonconvex sets
• Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
• Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems

zbMATH Keywords

numerical examplesnormal conefeasibility problemmethod of alternating projectionsprojection operatorlinear convergencemethod of alternating relaxed projections

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (15)

• Generalized alternating projections on manifolds and convex sets
• Regularity of sets under a reformulation in a product space with reduced dimension
• Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
• An alternating iterative method and its application in statistical inference
• Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
• Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
• Linear convergence of the Douglas–Rachford method for two closed sets
• Generalized relaxations of nonexpansive operators and convex feasibility problems
• On the existence of minimizers of proximity functions for split feasibility problems
• Global convergence and acceleration of projection methods for feasibility problems involving union convex sets
• Linear Convergence of Projection Algorithms
• Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms
• Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484479)