Coordinate descent with arbitrary sampling I: algorithms and complexity<sup>†</sup> (Q2829565): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Interior Gradient and Proximal Methods for Convex and Conic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated, Parallel, and Proximal Coordinate Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Stochastic Approximation Approach to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / 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: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal probabilities in stochastic coordinate descent methods / 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: Pegasos: primal estimated sub-gradient solver for SVM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable approximations and decomposition methods for the augmented Lagrangian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proximal Stochastic Gradient Method with Progressive Variance Reduction / rank
 
Normal rank

Latest revision as of 21:11, 12 July 2024

scientific article
Language Label Description Also known as
English
Coordinate descent with arbitrary sampling I: algorithms and complexity<sup>†</sup>
scientific article

    Statements

    Coordinate descent with arbitrary sampling I: algorithms and complexity<sup>†</sup> (English)
    0 references
    0 references
    0 references
    8 November 2016
    0 references
    coordinate descent
    0 references
    accelerated coordinate descent
    0 references
    arbitrary sampling
    0 references
    complexity analysis
    0 references

    Identifiers

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