Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (Q4638051): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv classification
 
cs.DS
Property / arXiv classification: cs.DS / rank
 
Normal rank
Property / arXiv classification
 
cs.LG
Property / arXiv classification: cs.LG / rank
 
Normal rank
Property / arXiv classification
 
cs.NA
Property / arXiv classification: cs.NA / rank
 
Normal rank
Property / arXiv classification
 
math.OC
Property / arXiv classification: math.OC / rank
 
Normal rank
Property / arXiv classification
 
stat.ML
Property / arXiv classification: stat.ML / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1407.1537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-Linear Time Positive LP Solver with Faster Convergence Rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Distributed Online Prediction using Mini-Batches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated, Parallel, and Proximal Coordinate Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic Regret Algorithms for Online Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal method for stochastic composite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to computing maximum flows using electrical flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320132 / 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: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual subgradient methods for convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating the cubic regularization of Newton's method on convex 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: Universal gradient methods for convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive restart for accelerated gradient schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Fractional Packing and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Learning and Online Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual perspective of online learning algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization / 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: Q4598189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896156 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964235750 / rank
 
Normal rank
Property / title
 
Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (English)
Property / title: Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (English) / rank
 
Normal rank

Latest revision as of 11:07, 30 July 2024

scientific article; zbMATH DE number 6866293
Language Label Description Also known as
English
Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent
scientific article; zbMATH DE number 6866293

    Statements

    0 references
    0 references
    3 May 2018
    0 references
    linear coupling
    0 references
    gradient descent
    0 references
    mirror descent
    0 references
    acceleration
    0 references
    cs.DS
    0 references
    cs.LG
    0 references
    cs.NA
    0 references
    math.OC
    0 references
    stat.ML
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (English)
    0 references

    Identifiers