A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization (Q2815509): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearized Bregman iterations for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative robust uncertainty principles and optimally sparse decompositions / 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: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborliness of randomly projected simplices in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least angle regression. (With discussion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier and gradient methods / 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: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear total variation based noise removal algorithms / 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: Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Reconstruction by Separable Approximation / 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 / cites work
 
Property / cites work: A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction / rank
 
Normal rank

Latest revision as of 06:44, 12 July 2024

scientific article
Language Label Description Also known as
English
A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
scientific article

    Statements

    A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization (English)
    0 references
    0 references
    0 references
    29 June 2016
    0 references
    nonsmooth convex minization
    0 references
    linear constraint
    0 references
    homotopy method
    0 references
    coordinate descent method
    0 references
    0 references
    0 references
    0 references

    Identifiers

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