Relaxed Variable Metric Primal-Dual Fixed-Point Algorithm with Applications

In this paper, a relaxed variable metric primal-dual fixed-point algorithm is proposed for solving the convex optimization problem involving the sum of two convex functions where one is differentiable with the Lipschitz continuous gradient while the other is composed of a linear operator. Based on t...

Full description

Bibliographic Details
Main Authors: Wenli Huang, Yuchao Tang, Meng Wen, Haiyang Li
Format: Article
Language:English
Published: MDPI AG 2022-11-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/10/22/4372