A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration (Q4917604)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration |
scientific article; zbMATH DE number 6159896
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration |
scientific article; zbMATH DE number 6159896 |
Statements
A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration (English)
0 references
2 May 2013
0 references
primal-dual fixed point algorithm
0 references
image restoration
0 references
convex optimiozation
0 references
numerical examples
0 references
convergence
0 references
0.9373169
0 references
0.9344121
0 references
0.9260858
0 references
0.92177534
0 references
0 references
0.9173256
0 references
0 references
