On optimal probabilities in stochastic coordinate descent methods (Q315487): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization / 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: Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of nonsmooth functions with parallel coordinate descent methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Iterative Methods for Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity analysis of randomized block-coordinate descent methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent with arbitrary sampling II: expected separable overapproximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design / 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: Distributed Coordinate Descent Method for Learning with Big Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization / 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: Inexact coordinate descent: complexity and preconditioning / rank
 
Normal rank

Revision as of 14:12, 12 July 2024

scientific article
Language Label Description Also known as
English
On optimal probabilities in stochastic coordinate descent methods
scientific article

    Statements

    On optimal probabilities in stochastic coordinate descent methods (English)
    0 references
    0 references
    0 references
    21 September 2016
    0 references
    coordinate descent
    0 references
    arbitrary sampling
    0 references
    first-order method
    0 references
    complexity
    0 references

    Identifiers