A composed alternating relaxed projection algorithm for convex feasibility problems

DOI10.1007/S10915-026-03474-7MaRDI QIDQ7395500zbMATH OpenFDO

Authors Yuting Shen, Jingwei Liang

Publication date 2026

Published in Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10915-026-03474-7

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25)

Cites work

• A convergent relaxation of the Douglas-Rachford algorithm
• Convergence rates with inexact non-expansive operators
• Convex analysis and monotone operator theory in Hilbert spaces
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Error bounds for the method of alternating projections
• Fast projection onto the simplex and the l₁ ball
• How Averaged is the Composition of Two Linear Projections?
• How to project onto the intersection of a closed affine subspace and a hyperplane
• Identifying active manifolds.
• Linear convergence of projection algorithms
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
• Local convergence properties of Douglas-Rachford and alternating direction method of multipliers
• Local linear convergence for alternating and averaged nonconvex projections
• Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence
• On the circumcentered-reflection method for the convex feasibility problem
• On the convergence of von Neumann's alternating projection algorithm for two sets
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
• Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
• Relaxed averaged alternating reflections for diffraction imaging
• The asymptotic behavior of the composition of two resolvents
• The method of projections for finding the common point of convex sets
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• The optimal error bound for the method of simultaneous projections
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle

This page was built for publication: A composed alternating relaxed projection algorithm for convex feasibility problems

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