Optimization · 2015 · 94 citations · 28 references
Natural SciencesMathematicsComputational GeometryOptimizationSet TheoryConvergence AnalysisConvex AnalysisConvex GeometryConvex OptimizationNumerical AlgorithmsClosed SetsConvergenceConvex Analysis Existence TheoremsConvex FunctionsConvex SetsLinear ConvergenceRegularity CriteriaStrong Convexity
In this paper, we investigate the Douglas–Rachford method (DR) for two closed (possibly nonconvex) sets in Euclidean spaces. We show that under certain regularity conditions, the DR converges locally with -linear rate. In convex settings, we prove that the linear convergence is global. Our study recovers recent results on the same topic.
28
On Projection Algorithms for Solving Convex Feasibility Problems
Heinz H. Bauschke, Jonathan M. Borwein · SIAM Review · 1996 · 1.7K citations
Computing, Mathematics, Algorithms +11