15 citations · 54 across the 38 of their papers we have counts for
6 papers · 1 filter
On quasi-convex smooth optimization problems by a comparison oracle
A. V. Gasnikov, M. S. Alkousa, A. V. Lobanov +4
Frequently, when dealing with many machine learning models, optimization problems appear to be challenging due to a limited understanding of the constructions and characterizations…
Accelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems
O. S. Savchuk, M. S. Alkousa, A. S. Shushko +4
In this paper, we propose some accelerated methods for solving optimization problems under the condition of relatively smooth and relatively Lipschitz continuous functions with an…
Mixed Newton Method for Optimization in Complex Spaces
Nikita Yudin, Roland Hildebrand, Sergey Bakhurin +5
In this paper, we modify and apply the recently introduced Mixed Newton Method, which is originally designed for minimizing real-valued functions of complex variables, to the minim…
Universal methods for variational inequalities: deterministic and stochastic cases
Anton Klimza, Alexander Gasnikov, Fedor Stonyakin +1
In this paper, we propose universal proximal mirror methods to solve the variational inequality problem with Holder continuous operators in both deterministic and stochastic settin…
Higher Degree Inexact Model for Optimization problems
Mohammad Alkousa, Fedor Stonyakin, Alexander Gasnikov +2
In this paper, it was proposed a new concept of the inexact higher degree -model of a function that is a generalization of the inexact -model, -oracle an…
Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
Mohammad Alkousa, Fedor Stonyakin, Asmaa Abdo +1
In this paper, the optimal convergence rate (where is the total number of iterations performed by the algorithm), without the presence of a logarithmic…