Restricted normal cones and sparsity optimization with affine constraints (Q404252)
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: Restricted normal cones and sparsity optimization with affine constraints |
scientific article; zbMATH DE number 6339547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Restricted normal cones and sparsity optimization with affine constraints |
scientific article; zbMATH DE number 6339547 |
Statements
Restricted normal cones and sparsity optimization with affine constraints (English)
0 references
4 September 2014
0 references
From authors' abstract: ``The problem of finding a vector with the fewest nonzero elements that satisfies an underdetermined system of linear equations is an NP-complete problem that is typically solved numerically via convex heuristics or nicely behaved nonconvex relaxations. In this paper, we consider the elementary method of alternating projections for solving the sparsity optimization problem without employing convex heuristics.''
0 references
alternating projections method
0 references
sparsity optimization
0 references
restricted normal cones
0 references
0 references
0 references
0 references
0.9043959
0 references
0.9032923
0 references
0.9015403
0 references
0.8966536
0 references
0.8943679
0 references
0 references
0.89208597
0 references
0.89187557
0 references
0.89094293
0 references
0.88981134
0 references
