On the finite termination of the Douglas-Rachford method for the convex feasibility problem

DOI10.1080/02331934.2016.1209674MaRDI QIDQ2836088zbMATH OpenOpenAlexFDO

Authors Shin-Ya Matsushita, Li Xu

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

zbMATH Keywords

error boundSlater conditionconvex feasibility problemmetric projectionnonexpansiveDouglas-Rachford methodfinite terminationsemidefinite feasibility problemconic feasibility problem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites work

• A finite steps algorithm for solving convex feasibility problems
• Accelerated reflection projection algorithm and its application to the LMI problem
• Convex analysis and monotone operator theory in Hilbert spaces
• Error Bounds for Linear Matrix Inequalities
• Error bounds for eigenvalue and semidefinite matrix inequality systems
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• Global Error Bounds for Convex Conic Problems
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Linear Matrix Inequalities in System and Control Theory
• New demiclosedness principles for (firmly) nonexpansive operators
• 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 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
• On weak convergence of the Douglas-Rachford method
• Reflection-projection method for convex feasibility problems with an obtuse cone
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• The convexity of \(A\) and \(B\) assures \(\text{int} A + B = \text{int}(A + B)\)
• The method of projections for finding the common point of convex sets

Cited in

(3)

• Multivariate approximation by polynomial and generalized rational functions
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
• The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions

This page was built for publication: On the finite termination of the Douglas-Rachford method for the convex feasibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836088)