3 papers
math.OC2021
On the Computational Efficiency of Catalyst Accelerated Coordinate Descent
Dmitry Pasechnyuk, Vladislav Matyukhin
This article is devoted to one particular case of using universal accelerated proximal envelopes to obtain computationally efficient accelerated versions of methods used to solve v…
math.OC2021
Accelerated Proximal Envelopes: Application to the Coordinate Descent Method
Dmitry Pasechnyuk, Anton Anikin, Vladislav Matyukhin
This article is devoted to one particular case of using universal accelerated proximal envelopes to obtain computationally efficient accelerated versions of methods used to solve v…
math.OC2020
The recovery model for the calculation of correspondence matrix for Moscow
Anastasiya Ivanova, Sergey Omelchenko, Ekaterina Kotliarova +1
In this paper, we consider the problem of restoring the correspondence matrix based on the observations of real correspondences in Moscow. Following the conventional approach, the…