On the finite termination of the Douglas-Rachford method for the convex feasibility problem
From MaRDI portal
Publication:2836088
DOI10.1080/02331934.2016.1209674OpenAlexW2488197880MaRDI QIDQ2836088
Publication date: 7 December 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1209674
error boundmetric projectionconvex feasibility problemfinite terminationSlater conditionnonexpansiveDouglas-Rachford methodsemidefinite feasibility problemconic feasibility problem
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions ⋮ Multivariate approximation by polynomial and generalized rational functions
Cites Work
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Reflection-projection method for convex feasibility problems with an obtuse cone
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On the rate of convergence of Krasnosel'skiĭ-Mann iterations and their connection with sums of Bernoullis
- The convexity of \(A\) and \(B\) assures \(\text{int} A + B = \text{int}(A + B)\)
- A finite steps algorithm for solving convex feasibility problems
- Error bounds for eigenvalue and semidefinite matrix inequality systems
- Lectures on Modern Convex Optimization
- On Weak Convergence of the Douglas–Rachford Method
- Accelerated reflection projection algorithm and its application to the LMI problem
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Linear Matrix Inequalities in System and Control Theory
- Global Error Bounds for Convex Conic Problems
- Error Bounds for Linear Matrix Inequalities
- On Projection Algorithms for Solving Convex Feasibility Problems
- The method of projections for finding the common point of convex sets
- New Demiclosedness Principles for (Firmly) Nonexpansive Operators
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: On the finite termination of the Douglas-Rachford method for the convex feasibility problem
