Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems
classification
🧮 math.OC
math.CO
keywords
combinatorialconvexproblemsrecentalgorithmsapplyingdiscussdouglas--rachford
read the original abstract
We discuss recent positive experiences applying convex feasibility algorithms of Douglas--Rachford type to highly combinatorial and far from convex problems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.