Parallel coordinate descent methods for big data optimization (Q263212): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-015-0901-6 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032395696 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59476352 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1212.0873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex 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 Methods for Linear Constraints: Convergence Rates and Conditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds / 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: 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: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgradient methods for 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: Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design / 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: On optimal probabilities in stochastic coordinate descent methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized Kaczmarz algorithm with exponential convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact coordinate descent: complexity and preconditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Methods by Space Decomposition and Subspace Correction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Dual Descent for Network Flow Optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-015-0901-6 / rank
 
Normal rank

Latest revision as of 12:54, 9 December 2024

scientific article
Language Label Description Also known as
English
Parallel coordinate descent methods for big data optimization
scientific article

    Statements

    Parallel coordinate descent methods for big data optimization (English)
    0 references
    0 references
    0 references
    4 April 2016
    0 references
    parallel coordinate descent
    0 references
    big data optimization
    0 references
    partial separability
    0 references
    huge-scale optimization
    0 references
    iteration complexity
    0 references
    expected separable over-approximation
    0 references
    composite objective
    0 references
    convex optimization
    0 references
    lasso
    0 references
    0 references

    Identifiers

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