A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems (Q2897274)
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 linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems |
scientific article; zbMATH DE number 6054031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems |
scientific article; zbMATH DE number 6054031 |
Statements
A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems (English)
0 references
10 July 2012
0 references
nonconvex affine feasibility
0 references
inverse problems
0 references
gradient projection algorithm
0 references
linear rate of convergence
0 references
scalable restricted isometry
0 references
mutual coherence of a matrix
0 references
sparse signal recovery
0 references
compressive sensing
0 references
affine rank minimization
0 references
0 references
0 references
0.7960626482963562
0 references
0.7777145504951477
0 references
0.7719699144363403
0 references
0.7676344513893127
0 references
0.7592608332633972
0 references
