betaFeedback

WorksMathematics

An algorithm for solving structured problems involving LL-infimal convolutions

Abstract

We develop an operator-splitting framework for solving structured minimization problems involving linear compositions of LL-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.

Paper details

vlnc:W_3wtkuhvn
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 9

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…