Linear convergence of projection algorithms
From MaRDI portal
Publication:5219736
Abstract: Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we study linear convergence of several projection algorithms for systems of finitely many closed sets. The results complement contemporary research on the same topic.
Recommendations
- Projection algorithms: Results and open problems
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- Convergence of projection algorithms to approximate solutions of convex feasibility problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- An algorithm for the convex feasibility problem
Cites work
- A cyclic Douglas-Rachford iteration scheme
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- A relaxation method for reconstructing objects from noisy X-rays
- About regularity of collections of sets
- About subtransversality of collections of sets
- Approximate subdifferentials and applications 3: the metric theory
- Convergence rate analysis for averaged fixed point iterations in common fixed point problems
- Convex analysis and monotone operator theory in Hilbert spaces
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Linear convergence of the Douglas-Rachford method for two closed sets
- Local linear convergence for alternating and averaged nonconvex projections
- Metric inequality, subdifferential calculus and applications
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces
- Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Reflection-projection method for convex feasibility problems with an obtuse cone
- Restricted normal cones and the method of alternating projections: applications
- Restricted normal cones and the method of alternating projections: theory
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- The Douglas-Rachford algorithm in the affine-convex case
- The method of alternating relaxed projections for two nonconvex sets
- The method of cyclic intrepid projections: convergence analysis and numerical experiments
- The Relaxation Method for Solving Systems of Linear Inequalities
- Transversality and alternating projections for nonconvex sets
- Variational Analysis
- Variational Analysis and Generalized Differentiation I
Cited in
(25)- A Lyapunov function construction for a non-convex Douglas-Rachford iteration
- Constraint reduction reformulations for projection algorithms with applications to wavelet construction
- Computing the resolvent of the sum of operators with application to best approximation problems
- Conversion of algorithms by releasing projection for minimization problems
- Normal projection: deterministic and probabilistic algorithms
- Union averaged operators with applications to proximal algorithms for MIN-convex functions
- The Douglas-Rachford algorithm for a hyperplane and a doubleton
- Computational acceleration of projection algorithms for the linear best approximation problem
- Numerical algorithm of Riesz projection and its convergence
- Projection algorithms: Results and open problems
- Application of projection algorithms to differential equations: boundary value problems
- Comparing averaged relaxed cutters and projection methods: theory and examples
- The convergency of the Kaczmarz projection algorithm
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Adaptive Douglas-Rachford splitting algorithm for the sum of two operators
- Regularity of sets under a reformulation in a product space with reduced dimension
- Generalized alternating projections on manifolds and convex sets
- A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
- Statistical convergence behavior of affine projection algorithms
- Douglas–Rachford is the best projection method in its family
- A composed alternating relaxed projection algorithm for convex feasibility problems
- On the convergence of row-modification algorithm for matrix projections
- Primal necessary characterizations of transversality properties
This page was built for publication: Linear convergence of projection algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5219736)
