A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration (Q2095175)
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 convex relaxation framework consisting of a primal-dual alternative algorithm for solving _0 sparsity-induced optimization problems with application to signal recovery based image restoration |
scientific article; zbMATH DE number 7614154
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration |
scientific article; zbMATH DE number 7614154 |
Statements
A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration (English)
0 references
9 November 2022
0 references
\(\ell_0\) sparsity-induced problem
0 references
nonconvex nonsmooth optimization
0 references
convex relaxation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7978028059005737
0 references
0.7853550314903259
0 references
0.7822837233543396
0 references
0.7814163565635681
0 references
0.780376136302948
0 references
