Zobrazeno 1 - 10
of 374
pro vyhledávání: '"Kovalev, Dmitry"'
Autor:
Kovalev, Dmitry
Optimization problems are ubiquitous in all quantitative scientific disciplines, from computer science and engineering to operations research and economics. Developing algorithms for solving various optimization problems has been the focus of mathema
Externí odkaz:
http://hdl.handle.net/10754/682331
Autor:
Yarmoshik, Demyan, Rogozin, Alexander, Kiselev, Nikita, Dorin, Daniil, Gasnikov, Alexander, Kovalev, Dmitry
We consider the decentralized minimization of a separable objective $\sum_{i=1}^{n} f_i(x_i)$, where the variables are coupled through an affine constraint $\sum_{i=1}^n\left(\mathbf{A}_i x_i - b_i\right) = 0$. We assume that the functions $f_i$, mat
Externí odkaz:
http://arxiv.org/abs/2407.02020
Publikováno v:
Известия Саратовского университета. Новая серия Серия: Физика, Vol 21, Iss 2, Pp 165-177 (2021)
Background and Objectives: The experimental and mathematical simulation was performed which aimed to study the mechanism of blood sedimentation process, which is the base of the standard medical diagnostic ESR method. Experimentally and by means of p
Externí odkaz:
https://doaj.org/article/e5833fb6cce046779f9dab50934962e3
We consider the task of minimizing the sum of convex functions stored in a decentralized manner across the nodes of a communication network. This problem is relatively well-studied in the scenario when the objective functions are smooth, or the links
Externí odkaz:
http://arxiv.org/abs/2405.18031
Autor:
Metelev, Dmitry, Chezhegov, Savelii, Rogozin, Alexander, Beznosikov, Aleksandr, Sholokhov, Alexander, Gasnikov, Alexander, Kovalev, Dmitry
We consider decentralized time-varying stochastic optimization problems where each of the functions held by the nodes has a finite sum structure. Such problems can be efficiently solved using variance reduction techniques. Our aim is to explore the l
Externí odkaz:
http://arxiv.org/abs/2402.02490
Autor:
Borodich, Ekaterina, Kormakov, Georgiy, Kovalev, Dmitry, Beznosikov, Aleksandr, Gasnikov, Alexander
In this work, we focuses on the following saddle point problem $\min_x \max_y p(x) + R(x,y) - q(y)$ where $R(x,y)$ is $L_R$-smooth, $\mu_x$-strongly convex, $\mu_y$-strongly concave and $p(x), q(y)$ are convex and $L_p, L_q$-smooth respectively. We p
Externí odkaz:
http://arxiv.org/abs/2307.12946
Autor:
Lobanov, Aleksandr, Veprikov, Andrew, Konin, Georgiy, Beznosikov, Aleksandr, Gasnikov, Alexander, Kovalev, Dmitry
Distributed optimization has a rich history. It has demonstrated its effectiveness in many machine learning applications, etc. In this paper we study a subclass of distributed optimization, namely decentralized optimization in a non-smooth setting. D
Externí odkaz:
http://arxiv.org/abs/2307.00392
We consider decentralized optimization problems where one aims to minimize a sum of convex smooth objective functions distributed between nodes in the network. The links in the network can change from time to time. For the setting when the amount of
Externí odkaz:
http://arxiv.org/abs/2301.11817
In this paper we study the smooth strongly convex minimization problem $\min_{x}\min_y f(x,y)$. The existing optimal first-order methods require $\mathcal{O}(\sqrt{\max\{\kappa_x,\kappa_y\}} \log 1/\epsilon)$ of computations of both $\nabla_x f(x,y)$
Externí odkaz:
http://arxiv.org/abs/2212.14439
Decentralized optimization over time-varying networks has a wide range of applications in distributed learning, signal processing and various distributed control problems. The agents of the distributed system locally hold optimization objectives and
Externí odkaz:
http://arxiv.org/abs/2210.09719