Restricted normal cones and sparsity optimization with affine constraints (Q404252): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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.'' | |||
| Property / review text: 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.'' / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Hans Benker / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 49M20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 49J52 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C30 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6339547 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
alternating projections method | |||
| Property / zbMATH Keywords: alternating projections method / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sparsity optimization | |||
| Property / zbMATH Keywords: sparsity optimization / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
restricted normal cones | |||
| Property / zbMATH Keywords: restricted normal cones / rank | |||
Normal rank | |||
Revision as of 17:05, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Restricted normal cones and sparsity optimization with affine constraints |
scientific article |
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
