A general decomposition method for a convex problem related to total variation minimization
Hilb, Stephan and Langer, Andreas LU
(2025)
In The SMAI Journal of computational mathematics
11.
p.693-726
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/88aed087-9c7e-44aa-a7e1-86ddb00b4c1e
- author
- Hilb, Stephan
and Langer, Andreas
LU
- organization
- publishing date
- 2025
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- domain decomposition, total variation minimization, convex optimisation, image restoration, convergence analysis, subspace correction
- in
- The SMAI Journal of computational mathematics
- volume
- 11
- pages
- 34 pages
- publisher
- Centre Mersenne
- external identifiers
-
- scopus:105032777234
- ISSN
- 2426-8399
- DOI
- 10.5802/smai-jcm.140
- language
- English
- LU publication?
- yes
- id
- 88aed087-9c7e-44aa-a7e1-86ddb00b4c1e
- date added to LUP
- 2023-10-10 17:57:06
- date last changed
- 2026-05-18 14:25:46
@article{88aed087-9c7e-44aa-a7e1-86ddb00b4c1e,
author = {{Hilb, Stephan and Langer, Andreas}},
issn = {{2426-8399}},
keywords = {{domain decomposition; total variation minimization; convex optimisation; image restoration; convergence analysis; subspace correction}},
language = {{eng}},
pages = {{693--726}},
publisher = {{Centre Mersenne}},
series = {{The SMAI Journal of computational mathematics}},
title = {{A general decomposition method for a convex problem related to total variation minimization}},
url = {{http://dx.doi.org/10.5802/smai-jcm.140}},
doi = {{10.5802/smai-jcm.140}},
volume = {{11}},
year = {{2025}},
}