On discrete \(\ell ^{1}\)-regularization (Q1946524): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linear <i>L</i> <sub>1</sub> Approximation for a Discrete Point Set and <i>L</i> <sub>1</sub> Solutions of Overdetermined Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite dimensional convexity and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Minimization Methods of Mixed l2-l1 and l1-l1 Norms for Image Restoration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4396948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-Widths in L ∞ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3897445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity algorithms for the L1/TV image denoising model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse representations and approximation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Chebyshev properties for \(L^ 1\)-approximation of continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing / rank
 
Normal rank

Latest revision as of 09:24, 6 July 2024

scientific article
Language Label Description Also known as
English
On discrete \(\ell ^{1}\)-regularization
scientific article

    Statements

    On discrete \(\ell ^{1}\)-regularization (English)
    0 references
    0 references
    0 references
    15 April 2013
    0 references
    The authors consider the discrete \(l^1\)-regularization problem \[ \min\{|y- Ax|_1+ \rho|x|_1: x\in\mathbb{R}^n\} \] and present some general observations concerning the variational solution of this problem. Specifically, a characterization of all solutions of this problem is given and also some information about the geometry of the set of all solutions and a method to compute a solution.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    sparsity
    0 references
    \(l ^{1}\) approximation
    0 references
    convex optimization
    0 references
    vector alternation
    0 references
    vector equioscillation
    0 references
    compressed sensing
    0 references
    discrete \(l^1\)-regularization problem
    0 references
    0 references
    0 references