A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems (Q2897274): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-1-4419-9569-8_3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W189211379 / rank | |||
Normal rank | |||
Revision as of 23:42, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems |
scientific article |
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
