Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples
From MaRDI portal
Publication:3298016
DOI10.1007/978-3-030-36568-4_5zbMath1468.90142arXiv1810.02463OpenAlexW3014046004MaRDI QIDQ3298016
Scott B. Lindstrom, R. Díaz Millán, Vera Roshchina
Publication date: 21 July 2020
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.02463
Related Items
The projected polar proximal point algorithm converges globally ⋮ Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems ⋮ Alternating conditional gradient method for convex feasibility problems ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Iterative methods for fixed point problems in Hilbert spaces
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- A note on alternating projections for ill-posed semidefinite feasibility problems
- Partial inverse of a monotone operator
- There is no variational characterization of the cycles in the method of periodic projections
- About subtransversality of collections of sets
- A new projection method for finding the closest point in the intersection of convex sets
- The Douglas-Rachford algorithm for the case of the sphere and the line
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres
- Matrix product constraints by projection methods
- An alternating projection that does not converge in norm
- Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
- On the finite convergence of a projected cutter method
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Global convergence of a non-convex Douglas-Rachford iteration
- The Douglas–Rachford Algorithm in the Absence of Convexity
- DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
- On Weak Convergence of the Douglas–Rachford Method
- APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS
- An explicit algorithm for monotone variational inequalities
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Decomposition through formalization in a product space
- A relaxed projection method for variational inequalities
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Cyclic subgradient projections
- A counterexample to De Pierro's conjecture on the convergence of under-relaxed cyclic projections
- Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
- Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
- Linear Convergence of Projection Algorithms
- On Subgradient Projectors
- Convex Analysis
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Convex analysis and monotone operator theory in Hilbert spaces
