A dual split Bregman method for fast $\ell ^1$ minimization (Q5326502): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear inverse scale space methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive inverse scale space method for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error estimation for Bregman iterations and inverse scale space methods in image restoration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearized Bregman iterations for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the linearized Bregman iteration for ℓ₁-norm minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split Bregman Methods and Frame Based Image Restoration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / 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: Compressed sensing / 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: Q4702909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Split Bregman Method for L1-Regularized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence rate of Douglas-Rachford operator splitting method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated linearized Bregman method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Variational Approach for Sharpening High Dimensional Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Regularization Method for Total Variation-Based Image Restoration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast linearized Bregman iteration for compressive sensing and sparse denoising / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and Generalizations of the Linearized Bregman Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1090/s0025-5718-2013-02700-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072238928 / rank
 
Normal rank

Latest revision as of 10:14, 30 July 2024

scientific article; zbMATH DE number 6195247
Language Label Description Also known as
English
A dual split Bregman method for fast $\ell ^1$ minimization
scientific article; zbMATH DE number 6195247

    Statements

    A dual split Bregman method for fast $\ell ^1$ minimization (English)
    0 references
    0 references
    0 references
    0 references
    6 August 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(\ell^1\)-minimization
    0 references
    optimization algorithms
    0 references
    sparsity
    0 references
    compressed sensing
    0 references
    calculus of variation
    0 references
    0 references
    0 references
    0 references