ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2405.18031
  4. Cited By
Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized
  Optimization over Time-Varying Networks

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks

28 May 2024
D. Kovalev
Ekaterina Borodich
Alexander Gasnikov
Dmitrii Feoktistov
ArXivPDFHTML

Papers citing "Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks"

3 / 3 papers shown
Title
Optimal Algorithms for Decentralized Stochastic Variational Inequalities
Optimal Algorithms for Decentralized Stochastic Variational Inequalities
D. Kovalev
Aleksandr Beznosikov
Abdurakhmon Sadiev
Michael Persiianov
Peter Richtárik
Alexander Gasnikov
33
34
0
06 Feb 2022
ADOM: Accelerated Decentralized Optimization Method for Time-Varying
  Networks
ADOM: Accelerated Decentralized Optimization Method for Time-Varying Networks
D. Kovalev
Egor Shulgin
Peter Richtárik
Alexander Rogozin
Alexander Gasnikov
ODL
29
30
0
18 Feb 2021
Linear Convergence of Gradient and Proximal-Gradient Methods Under the
  Polyak-Łojasiewicz Condition
Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition
Hamed Karimi
J. Nutini
Mark W. Schmidt
119
1,194
0
16 Aug 2016
1