Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility

DOI10.1109/TSP.2014.2339801zbMath1394.94227arXiv1307.2009MaRDI QIDQ4579457

Robert Hesse, D. Russell Luke, Patrick Neumann

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Set-valued and variational analysis (49J53) Iterative procedures involving nonlinear operators (47J25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (39)

On the order of the operators in the Douglas-Rachford algorithm ⋮ On the Douglas-Rachford algorithm ⋮ Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem ⋮ Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms ⋮ 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 ⋮ Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging ⋮ Circumcentering the Douglas-Rachford method ⋮ Regularity properties of non-negative sparsity sets ⋮ Local convergence properties of Douglas-Rachford and alternating direction method of multipliers ⋮ A splitting method for finding the resolvent of the sum of two maximal monotone operators ⋮ On the linear convergence of the circumcentered-reflection method ⋮ Tight global linear convergence rate bounds for Douglas-Rachford splitting ⋮ A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem ⋮ Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning ⋮ 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 ⋮ The block-wise circumcentered-reflection method ⋮ A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance ⋮ Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems ⋮ Activity Identification and Local Linear Convergence of Douglas–Rachford/ADMM under Partial Smoothness ⋮ Projection methods for quantum channel construction ⋮ A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization ⋮ 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 ⋮ General splitting methods with linearization for the split feasibility problem ⋮ Douglas-Rachford splitting for the sum of a Lipschitz continuous and a strongly monotone operator ⋮ A convergent relaxation of the Douglas-Rachford algorithm ⋮ Linear convergence of the Douglas–Rachford method for two closed sets ⋮ The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces ⋮ Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results ⋮ Alternating conditional gradient method for convex feasibility problems ⋮ Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings ⋮ \( \alpha \)-firmly nonexpansive operators on metric spaces ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging ⋮ Method of alternating projections for the general absolute value equation ⋮ Phase Retrieval with Sparse Phase Constraint

This page was built for publication: Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility