Recent results on Douglas-Rachford methods.
From MaRDI portal
combinatorial optimizationDouglas-Rachford methodfeasibilitymodellingNonogramsprojectionsreflectionssatisfiabilitySudoku
Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- The Douglas-Rachford algorithm in the absence of convexity
- On the local convergence of the Douglas-Rachford algorithm
Cited in
(8)- Circumcentering reflection methods for nonconvex feasibility problems
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
- On the local convergence of the Douglas-Rachford algorithm
- Douglas-Rachford feasibility methods for matrix completion problems
- Application of projection algorithms to differential equations: boundary value problems
- Local linear convergence of the ADMM/Douglas-Rachford algorithms without strong convexity and application to statistical imaging
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Edelstein’s Astonishing Affine Isometry
This page was built for publication: Recent results on Douglas-Rachford methods.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261774)