An algorithm for solving structured problems involving $L$-infimal convolutions
We develop an operator-splitting framework for solving structured minimization problems involving linear compositions of $L$-infimal convolutions. We introduce a primal-dual shadow Douglas-Rachford splitting method and establish its convergence. As a result, we derive a fully primal-dual splitting algorithm for the class of the aforementioned minimization problems.
math.OC↗