Coordinate descent with arbitrary sampling II: expected separable overapproximation (Q2829566): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56813560 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962990180 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1412.8063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Block Coordinate Descent Type Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated, Parallel, and Proximal Coordinate Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4303969 / 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: 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: 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: Parallel coordinate descent methods for big data optimization / 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: Convergence of a block coordinate descent method for nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:11, 12 July 2024

scientific article
Language Label Description Also known as
English
Coordinate descent with arbitrary sampling II: expected separable overapproximation
scientific article

    Statements

    Coordinate descent with arbitrary sampling II: expected separable overapproximation (English)
    0 references
    0 references
    0 references
    8 November 2016
    0 references
    coordinate descent
    0 references
    randomized methods
    0 references
    arbitrary sampling
    0 references
    expected separable overapproximation
    0 references
    parallel and distributed coordinate descent
    0 references

    Identifiers

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