Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
From MaRDI portal
Publication:5013582
DOI10.1137/20M1358669MaRDI QIDQ5013582
Luiz-Rafael Santos, Roger Behling, Yunier Y. Bello Cruz
Publication date: 1 December 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.03354
Numerical mathematical programming methods (65K05) Convex programming (90C25) Decomposition methods (49M27) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items (3)
Circumcentric directions of cones ⋮ On the centralization of the circumcentered-reflection method ⋮ A successive centralized circumcentered-reflection method for the convex feasibility problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Single-projection procedure for linear optimization
- A note on alternating projections for ill-posed semidefinite feasibility problems
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- There is no variational characterization of the cycles in the method of periodic projections
- Transversality and alternating projections for nonconvex sets
- A finitely convergent ``row-action method for the convex feasibility problem
- Error bounds for the method of alternating projections
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Dykstra's alternating projection algorithm for two sets
- The rate of convergence for the method of alternating projections. II
- Finding a best approximation pair of points for two polyhedra
- About intrinsic transversality of pairs of sets
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- On the von Neumann alternating algorithm in Hilbert space
- Stochastic alternating projections
- The effect of calmness on the solution set of systems of nonlinear equations
- The circumcentered-reflection method achieves better rates than alternating projections
- A note on the finite convergence of alternating projections
- The block-wise circumcentered-reflection method
- Local convergence analysis of the Levenberg-Marquardt framework for nonzero-residue nonlinear least-squares problems under an error bound condition
- The rate of convergence in the method of alternating projections
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
- A Fast Randomized Algorithm for Orthogonal Projection
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Proximity Maps for Convex Sets
- Projection methods: an annotated bibliography of books and reviews
- Characterizing arbitrarily slow convergence in the method of alternating projections
- Practical and mathematical aspects of the problem of reconstructing objects from radiographs
- Decomposition through formalization in a product space
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Variational Analysis
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
- Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
- Algorithms and Convergence Results of Projection Methods for Inconsistent Feasibility Problems: A Review
- Fast Algorithms for Projection on an Ellipsoid
- The method of projections for finding the common point of convex sets
- Theory of Reproducing Kernels
- Functional Operators (AM-22), Volume 2
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections