Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
From MaRDI portal
(Redirected from Publication:5013582)
Recommendations
- A note on the finite convergence of alternating projections
- Error bounds for the method of alternating projections
- On the rate of convergence of the alternating projection method in finite dimensional spaces
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- Strong convergence of alternating projections
- Error bounds for the method of simultaneous projections with infinitely many subspaces
- Local linear convergence for inexact alternating projections on nonconvex sets
- The convergence properties of infeasible inexact proximal alternating linearized minimization
- \(L^p\) error estimates for projection approximations
Cites work
- A fast randomized algorithm for orthogonal projection
- A finitely convergent ``row-action method for the convex feasibility problem
- A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
- A note on alternating projections for ill-posed semidefinite feasibility problems
- A note on the finite convergence of alternating projections
- About intrinsic transversality of pairs of sets
- Algorithms and convergence results of projection methods for inconsistent feasibility problems: a review
- Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Characterizing arbitrarily slow convergence in the method of alternating projections
- Convergence rate analysis for averaged fixed point iterations in common fixed point problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Decomposition through formalization in a product space
- Dykstra's alternating projection algorithm for two sets
- Error bounds for the method of alternating projections
- Fast Algorithms for Projection on an Ellipsoid
- Finding a best approximation pair of points for two polyhedra
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Functional Operators (AM-22), Volume 2
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 65765 (Why is no real title available?)
- scientific article; zbMATH DE number 125933 (Why is no real title available?)
- scientific article; zbMATH DE number 1009689 (Why is no real title available?)
- scientific article; zbMATH DE number 878830 (Why is no real title available?)
- scientific article; zbMATH DE number 3029984 (Why is no real title available?)
- Local convergence analysis of the Levenberg-Marquardt framework for nonzero-residue nonlinear least-squares problems under an error bound condition
- On Projection Algorithms for Solving Convex Feasibility Problems
- 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
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- On the von Neumann alternating algorithm in Hilbert space
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Practical and mathematical aspects of the problem of reconstructing objects from radiographs
- Projection methods: an annotated bibliography of books and reviews
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximity Maps for Convex Sets
- Single-projection procedure for linear optimization
- Stochastic alternating projections
- The block-wise circumcentered-reflection method
- The circumcentered-reflection method achieves better rates than alternating projections
- The effect of calmness on the solution set of systems of nonlinear equations
- The method of projections for finding the common point of convex sets
- The rate of convergence for the method of alternating projections. II
- The rate of convergence in the method of alternating projections
- Theory of Reproducing Kernels
- There is no variational characterization of the cycles in the method of periodic projections
- Transversality and alternating projections for nonconvex sets
- Variational Analysis
Cited in
(12)- A note on the finite convergence of alternating projections
- Restricted normal cones and the method of alternating projections: applications
- A note on alternating projections for ill-posed semidefinite feasibility problems
- Circumcentric directions of cones
- On the centralization of the circumcentered-reflection method
- A successive centralized circumcentered-reflection method for the convex feasibility problem
- Infeasibility and error bound imply finite convergence of alternating projections
- Single-projection procedure for infinite dimensional convex optimization problems
- A finitely convergent circumcenter method for the convex feasibility problem
- An efficient algorithm for the _p norm based metric nearness problem
- Douglas–Rachford is the best projection method in its family
- An inexact alternating projection method with application to matrix completion
This page was built for publication: Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013582)
