Linear Convergence of Projection Algorithms
DOI10.1287/moor.2018.0942zbMath1446.47064arXiv1609.00341OpenAlexW3105858912WikidataQ128030013 ScholiaQ128030013MaRDI QIDQ5219736
Publication date: 12 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.00341
linear convergencestrong regularityDouglas-Rachford algorithmsuperregularitycyclic projectionslinear regularityquasi coercivityinjectable setquasi firm Fejér monotonicityreflection-projection algorithmsemi-intrepid projection
Numerical mathematical programming methods (65K05) Nonsmooth analysis (49J52) Iterative procedures involving nonlinear operators (47J25) Numerical methods based on nonlinear programming (49M37)
Related Items (12)
Uses Software
Cites Work
- Unnamed Item
- On local convergence of the method of alternating projections
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- Restricted normal cones and the method of alternating projections: applications
- Restricted normal cones and the method of alternating projections: theory
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- The method of alternating relaxed projections for two nonconvex sets
- About subtransversality of collections of sets
- Reflection-projection method for convex feasibility problems with an obtuse cone
- Local linear convergence for alternating and averaged nonconvex projections
- Transversality and alternating projections for nonconvex sets
- The Douglas-Rachford algorithm in the affine-convex case
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- A cyclic Douglas-Rachford iteration scheme
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- About regularity of collections of sets
- Linear convergence of the Douglas–Rachford method for two closed sets
- Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study
- Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
- Approximate subdifferentials and applications 3: the metric theory
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The Relaxation Method for Solving Systems of Linear Inequalities
- A relaxation method for reconstructing objects from noisy X-rays
- Variational Analysis
- Variational Analysis and Generalized Differentiation I
- On Projection Algorithms for Solving Convex Feasibility Problems
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Metric inequality, subdifferential calculus and applications
This page was built for publication: Linear Convergence of Projection Algorithms