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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Shawn Xianfu Wang / rank
Normal rank
 
Property / author
 
Property / author: Shawn Xianfu Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107479212 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1205.0320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Reproducing Kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and monotone operator theory in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflection-projection method for convex feasibility problems with an obtuse cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted normal cones and the method of alternating projections: theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted normal cones and the method of alternating projections: applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropic Regularization of the ℓ 0 Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques of variational analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of successive projections for finding a common point of sets in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best approximation in inner product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ <sup>1</sup> minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Projections on Manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local linear convergence for alternating and averaged nonconvex projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local linear convergence of approximate projections onto regularized sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximate Solutions to Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Functions and Solution Mappings / rank
 
Normal rank

Latest revision as of 23:31, 8 July 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
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references