5 papers
Stochastic variance reduced extragradient methods for solving hierarchical variational inequalities
Pavel Dvurechensky, Andrea Ebner, Johannes Carl Schnebel +2
We are concerned with optimization in a broad sense through the lens of solving variational inequalities (VIs) -- a class of problems that are so general that they cover as particu…
Extragradient methods with complexity guarantees for hierarchical variational inequalities
Pavel Dvurechensky, Meggie Marschner, Shimrit Shtern +1
In the framework of a real Hilbert space we consider the problem of approaching solutions to a class of hierarchical variational inequality problems, subsuming several other proble…
On Solving Minimization and Min-Max Problems by First-Order Methods with Relative Error in Gradients
Artem Vasin, Valery Krivchenko, Dmitry Kovalev +6
First-order methods for minimization and saddle point (min-max) problems are widely used for solving large-scale problems, in particular arising in machine learning. The majority o…
Decentralised convex optimisation with probability-proportional-to-size quantization
Dmitrii Pasechniuk, Pavel Dvurechensky, César A. Uribe +1
Communication is one of the bottlenecks of distributed optimisation and learning. To overcome this bottleneck, we propose a novel quantization method that transforms a vector into…
A conditional gradient homotopy method with applications to Semidefinite Programming
Pavel Dvurechensky, Gabriele Iommazzo, Shimrit Shtern +1
We propose a new homotopy-based conditional gradient method for solving convex optimization problems with a large number of simple conic constraints. Instances of this template nat…