A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2164449950 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1306.5386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of bounded variation penalty methods for ill-posed problems / rank
 
Normal rank
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: Convergence of a block coordinate descent method for nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: NESTA: A Fast and Accurate First-Order Method for Sparse Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Templates for convex cone problems with applications to sparse signal recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CoSaMP: Iterative signal recovery from incomplete and inaccurate samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration / 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: Q3096154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple View Geometry in Computer Vision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel coordinate descent methods for big data optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Block-coordinate Relaxation for Regularized Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms for lasso penalized regression / rank
 
Normal rank

Latest revision as of 16:55, 11 July 2024

scientific article
Language Label Description Also known as
English
A second-order method for strongly convex \(\ell _1\)-regularization problems
scientific article

    Statements

    A second-order method for strongly convex \(\ell _1\)-regularization problems (English)
    0 references
    0 references
    0 references
    4 April 2016
    0 references
    \(\ell_1\)-regularization
    0 references
    strongly convex optimization
    0 references
    second-order methods
    0 references
    iteration complexity
    0 references
    Newton conjugate-gradients method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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