Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application
Optimization problems involving the sum of three convex functions have received much attention in recent years, where one is differentiable with Lipschitz continuous gradient, one is composed of a linear operator and the other is proximity friendly. The primal-dual fixed point algorithm is a simple...
Uložené v:
| Vydané v: | Applied numerical mathematics Ročník 157; s. 236 - 254 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.11.2020
|
| Predmet: | |
| ISSN: | 0168-9274, 1873-5460 |
| 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!