A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization (Q535291): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Mathematical Programming for Data Mining: Formulations and Challenges / 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: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least angle regression. (With discussion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An EM algorithm for wavelet-based image restoration / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sparse Representations in Arbitrary Redundant Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds and convergence analysis of feasible descent methods: A general approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large scale kernel regression via linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to variable selection in least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: LASSO-pattern search algorithm with application to ophthalmology and genomic data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wavelets and curvelets for image deconvolution: a combined approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Just relax: convex programming methods for identifying sparse signals in noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coordinate gradient descent method for nonsmooth separable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Reconstruction by Separable Approximation / rank
 
Normal rank

Latest revision as of 01:40, 4 July 2024

scientific article
Language Label Description Also known as
English
A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
scientific article

    Statements

    A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization (English)
    0 references
    0 references
    0 references
    11 May 2011
    0 references
    0 references
    coordinate gradient descent
    0 references
    Q-linear convergence
    0 references
    \(\ell_{1}\)-regularization
    0 references
    compressed sensing
    0 references
    image deconvolution
    0 references
    linear least squares
    0 references
    logistic regression
    0 references
    convex optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references