Abstract
We present a simple primal-dual framework for solving structured convex optimization problems involving the sum of a Lipschitz-differentiable function and two nonsmooth proximable functions, one of which is composed with a linear mapping. The framework is based on the recently proposed asymmetric forward-backward-adjoint three-term splitting (AFBA); depending on the value of two parameters, (extensions of) known algorithms as well as many new primal-dual schemes are obtained. This allows for a unified analysis that, among other things, establishes linear convergence under four different regularity assumptions for the cost functions. Most notably, linear convergence is established for the class of problems with piecewise linear-quadratic cost functions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
