An inertial primal‐dual fixed point algorithm for composite optimization problems

In this paper, we consider an inertial primal‐dual fixed point algorithm (IPDFP) to compute the minimizations of the sum of a non‐smooth convex function and a finite family of composite non‐smooth convex functions, each one of which is composed of a non‐smooth convex function and a bounded linear op...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical methods in the applied sciences Jg. 45; H. 17; S. 10628 - 10639
Hauptverfasser: Wen, Meng, Tang, Yuchao, Cui, Angang, Peng, Jigen
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Freiburg Wiley Subscription Services, Inc 30.11.2022
Schlagworte:
Algorithms
composite optimization
Computational geometry
Convergence
Convex analysis
Convexity
Fixed points (mathematics)
Image processing
inertial algorithm
Iterative algorithms
Iterative methods
Linear operators
operator splitting
Operators (mathematics)
Optimization
Preconditioning
proximity operator
Splitting
ISSN:0170-4214, 1099-1476
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we consider an inertial primal‐dual fixed point algorithm (IPDFP) to compute the minimizations of the sum of a non‐smooth convex function and a finite family of composite non‐smooth convex functions, each one of which is composed of a non‐smooth convex function and a bounded linear operator. This is a full splitting approach, in the sense that non‐smooth functions are processed individually via their proximity operators. The convergence of the IPDFP is obtained by reformulating the problem to the sum of three non‐smooth convex functions. Furthermore, we propose a preconditioning technique for the IPDFP. The key idea of the preconditioning technique is that the constant iterative parameters are updated self‐adaptively in the iteration process. What's more, we also give a simple and easy way to choose the diagonal preconditioners while the convergence of the iterative algorithms is maintained. This work brings together and notably extends several classical splitting schemes, like the primal‐dual method proposed by Chambolle and Pock, and the recent proximity algorithms of Charles et al. designed for the L1$$ {L}_1 $$/TV image denoising model. The iterative algorithm is used for solving non‐differentiable convex optimization problems arising in image processing.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0170-4214
1099-1476
DOI:10.1002/mma.8388