The Douglas–Rachford Algorithm in the Absence of Convexity
- 9 May 2011
- book chapter
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Divide and concur: A general approach to constraint satisfactionPhysical Review E, 2008
- Full analogy of Sharkovsky's theorem for lower semicontinuous mapsJournal of Mathematical Analysis and Applications, 2008
- A multivalued version of Sharkovskiĭ’s theorem holds with at most two exceptionsJournal of Fixed Point Theory and Applications, 2007
- Searching with iterated mapsProceedings of the National Academy of Sciences of the United States of America, 2007
- A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert spaceJournal of Approximation Theory, 2006
- Finding best approximation pairs relative to two closed convex sets in Hilbert spacesJournal of Approximation Theory, 2004
- On Projection Algorithms for Solving Convex Feasibility ProblemsSIAM Review, 1996
- Splitting Algorithms for the Sum of Two Nonlinear OperatorsSIAM Journal on Numerical Analysis, 1979
- Eclatement de contraintes en parallele pour la minimisation d'une forme quadratiqueLecture Notes in Computer Science, 1976
- On the numerical solution of heat conduction problems in two and three space variablesTransactions of the American Mathematical Society, 1956