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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical methods in the applied sciences Ročník 45; číslo 17; s. 10628 - 10639
Hlavní autori:	Wen, Meng, Tang, Yuchao, Cui, Angang, Peng, Jigen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Freiburg Wiley Subscription Services, Inc 30.11.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!