Restricted normal cones and sparsity optimization with affine constraints (Q404252): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1627489
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Shawn Xianfu Wang / rank
 
Normal rank

Revision as of 07:52, 29 February 2024

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
    0 references
    0 references
    0 references
    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
    0 references
    alternating projections method
    0 references
    sparsity optimization
    0 references
    restricted normal cones
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references