Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems
Francisco J. Arag\'on Artacho, Jonathan M. Borwein, Matthew K. Tam
TL;DR
This paper reviews recent successes in applying Douglas-Rachford algorithms, originally designed for convex problems, to complex combinatorial optimization problems that are far from convex.
Contribution
It highlights the adaptation and effectiveness of Douglas-Rachford methods in solving challenging combinatorial problems.
Findings
Positive results in applying convex feasibility algorithms to combinatorial problems
Demonstrated effectiveness of Douglas-Rachford methods in non-convex settings
Insights into algorithm performance on complex problems
Abstract
We discuss recent positive experiences applying convex feasibility algorithms of Douglas--Rachford type to highly combinatorial and far from convex problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.