In recent years, the Douglas-Rachford splitting method has been shown to be effective at solving many non-convex optimization problems. In this paper, a local convergence analysis for nonconvex feasibility problems is presented and both finite termination and local linear convergence are obtained. For a generalization of the Sudoku puzzle, it is proved that the local linear rate of convergence of Douglas-Rachford is exactly √ 5 5 and independent of puzzle size. For the s-queens problem, it is

more »

... oved that Douglas-Rachford converges after a finite number of iterations. Numerical results on solving Sudoku puzzles and s-queens puzzles are provided to support our theoretical findings.