13 citations · 19 across the 8 of their papers we have counts for
10 papers
Greedy sign-based box splitting: exact solvable classes, sharp thresholds and order-oracle complexity
Anton Anikin, Alexander Gornov, Tatiana Zarodnyuk +1
Greedy box splitting reads gradient signs at the centre and retains one smaller box. Its summable travel budget makes an incorrect exclusion irreversible. We determine when this ge…
Zero-Order Stochastic Conditional Gradient Sliding Method for Non-smooth Convex Optimization
Aleksandr Lobanov, Anton Anikin, Alexander Gasnikov +2
The conditional gradient idea proposed by Marguerite Frank and Philip Wolfe in 1956 was so well received by the community that new algorithms (also called Frank--Wolfe type algorit…
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…
Algorithms for local optimization of OPLS energy for large protein structures
Pavel Yakovlev, Anton Anikin, Olga Bolshakova +6
Many problems arise in computational biology can be reduced to the minimization of energy function, that determines on the geometry of considered molecule. The solution of this pro…
A universal modification of the linear coupling method
Sergey Guminov, Alexander Gasnikov, Anton Anikin +1
In the late sixties, N. Shor and B. Polyak independently proposed optimal first-order methods for non-smooth convex optimization problems. In 1982 A. Nemirovski proposed optimal fi…
Dual approaches to the strongly convex simple function minimization problem under affine restrictions
Anton Anikin, Alexander Gasnikov, Pavel Dvurechensky +2
We consider strongly convex optimization problems with affine-type restrictions. We build dual problem and solve dual problem by Fast Gradient Method. We use primal-dual structure…
Non accelerated efficient numerical methods for sparse quadratic optimization problems and its generalizations
Anton Anikin, Alexander Gasnikov, Alexander Gornov
We investigate primal gradient method with l1-norm and conditional gradient method (both methods are non accelerated). We show that these methods can outperform well known accelera…
Randomization and sparsity in huge-scale optimization on the Mirror Descent example
Anton Anikin, Alexander Gasnikov, Alexander Gornov
We investigate different randomizations for mirror descent method. We try to propose such a randomization that allows us to use sparsity of the problem as much as it possible. In t…
Efficient Numerical Methods to Solve Sparse Linear Equations with Application to PageRank
Anton Anikin, Alexander Gasnikov, Alexander Gornov +3
In this paper, we propose three methods to solve the PageRank problem for the transition matrices with both row and column sparsity. Our methods reduce the PageRank problem to the…
Efficient numerical algorithms for regularized regression problem with applications to traffic matrix estimations
Anton Anikin, Pavel Dvurechensky, Alexander Gasnikov +5
In this work we collect and compare to each other many different numerical methods for regularized regression problem and for the problem of projection on a hyperplane. Such proble…