On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
From MaRDI portal
Publication:288232
DOI10.1007/s10898-015-0373-5zbMath1345.90065arXiv1504.06969OpenAlexW1901524206MaRDI QIDQ288232
Hung M. Phan, Heinz H. Bauschke, Dominikus Noll, Minh N. Dao
Publication date: 25 May 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.06969
monotone operatorconvex setprojectorfinite convergencealternating projectionsconvex feasibility problemDouglas-Rachford algorithmepigraphmethod of reflection-projectionpartial inversepolyhedral setSlater's condition
Related Items
On the order of the operators in the Douglas-Rachford algorithm, Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems, Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems, Local convergence properties of Douglas-Rachford and alternating direction method of multipliers, The Douglas-Rachford algorithm for a hyperplane and a doubleton, Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples, A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting, Finitely convergent iterative methods with overrelaxations revisited, On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces, The Douglas-Rachford algorithm in the affine-convex case, Linear Convergence of Projection Algorithms, On the finite termination of the Douglas-Rachford method for the convex feasibility problem, SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD, Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators, Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Iterative methods for fixed point problems in Hilbert spaces
- Partial inverse of a monotone operator
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Reflection-projection method for convex feasibility problems with an obtuse cone
- A primal-dual projection method for solving systems of linear inequalities
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- Linear convergence of the Douglas–Rachford method for two closed sets
- Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- On Fixed Points of Non-Expansive Piecewise Isometric Mappings
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Monotone Operators and the Proximal Point Algorithm
- Variational Analysis
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
