An inner-outer iteration method for solving convex optimization problems involving the sum of three convex functions

DOI10.1360/SCM-2017-0313zbMATH Open1499.90162arXiv1705.06164WikidataQ127345379 ScholiaQ127345379MaRDI QIDQ5064097FDOQ5064097

Authors: Guo-rong Wu, Chuanxi Zhu, Yu-Chao Tang 

Publication date: 21 March 2022

Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Abstract: In this paper, we consider solving a class of convex optimization problem which minimizes the sum of three convex functions $f(x)+g(x)+h(Bx)$, where $f(x)$ is differentiable with a Lipschitz continuous gradient, $g(x)$ and $h(x)$ have a closed-form expression of their proximity operators and $B$ is a bounded linear operator. This type of optimization problem has wide application in signal recovery and image processing. To make full use of the differentiability function in the optimization problem, we take advantage of two operator splitting methods: the forward-backward splitting method and the three operator splitting method. In the iteration scheme derived from the two operator splitting methods, we need to compute the proximity operator of $g+hcircB$ and $hcircB$, respectively. Although these proximity operators do not have a closed-form solution in general, they can be solved very efficiently. We mainly employ two different approaches to solve these proximity operators: one is dual and the other is primal-dual. Following this way, we fortunately find that three existing iterative algorithms including Condat and Vu algorithm, primal-dual fixed point (PDFP) algorithm and primal-dual three operator (PD3O) algorithm are a special case of our proposed iterative algorithms. Moreover, we discover a new kind of iterative algorithm to solve the considered optimization problem, which is not covered by the existing ones. Under mild conditions, we prove the convergence of the proposed iterative algorithms. Numerical experiments applied on fused Lasso problem, constrained total variation regularization in computed tomography (CT) image reconstruction and low-rank total variation image super-resolution problem demonstrate the effectiveness and efficiency of the proposed iterative algorithms.

Full work available at URL: https://arxiv.org/abs/1705.06164

Recommendations

• A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
• Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application
• Preconditioned three-operator splitting algorithm with applications to image restoration
• A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
• scientific article; zbMATH DE number 7071979

zbMATH Keywords

total variationprimal-dualforward-backward splitting algorithmthree operator splitting algorithm

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25)

Cited In (5)

• A first-order splitting method for solving a large-scale composite convex optimization problem
• Simultaneous reconstruction of optical absorption property and speed of sound in intravascular photoacoustic tomography
• Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application
• Title not available (Why is that?)
• Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications

This page was built for publication: An inner-outer iteration method for solving convex optimization problems involving the sum of three convex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5064097)