Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems
Optimization and Control
2015-07-01 v1 Combinatorics
Abstract
We discuss recent positive experiences applying convex feasibility algorithms of Douglas--Rachford type to highly combinatorial and far from convex problems.
Cite
@article{arxiv.1305.2657,
title = {Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems},
author = {Francisco J. Aragón Artacho and Jonathan M. Borwein and Matthew K. Tam},
journal= {arXiv preprint arXiv:1305.2657},
year = {2015}
}