A distributed Douglas-Rachford splitting method for solving linear constrained multi-block weakly convex problems
Abstract
In recent years, a distributed Douglas-Rachford splitting method (DDRSM) has been proposed to tackle multi-block separable convex optimization problems. This algorithm offers relatively easier subproblems and greater efficiency for large-scale problems compared to various augmented-Lagrangian-based parallel algorithms. Building upon this, we explore the extension of DDRSM to weakly convex cases. By assuming weak convexity of the objective function and introducing an error bound assumption, we demonstrate the linear convergence rate of DDRSM. Some promising numerical experiments involving compressed sensing and robust alignment of structures across images (RASL) show that DDRSM has advantages over augmented-Lagrangian-based algorithms, even in weakly convex scenarios.
Keywords
Cite
@article{arxiv.2411.11486,
title = {A distributed Douglas-Rachford splitting method for solving linear constrained multi-block weakly convex problems},
author = {Leyu Hu and Jiaxin Xie and Xingju Cai and Deren Han},
journal= {arXiv preprint arXiv:2411.11486},
year = {2024}
}