Mohammad Alkousa

Dr. Mohammad Alkousa

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 July 2021 in Optimization Methods and Software
Verified
Journal Article
Closed access
FSFedor Stonyakin
Fedor Stonyakin
ATAlexander Tyurin
Alexander Tyurin
AGAlexander Gasnikov
Alexander Gasnikov
PDPavel Dvurechensky
Pavel Dvurechensky
AAArtem Agafonov
Artem Agafonov
VPVictorya Piskunova
Victorya Piskunova
In this paper, we propose a general algorithmic framework for the first-order methods in optimization in a broad sense, including minimization problems, saddle-point problems and variational inequalities (VIs). This framework allows obtaining many known methods as a special case, the list including accelerated gradient method, composite optimization methods, level-set methods, Bregman proximal methods. The idea of the framework is based on constructing an inexact model of the main problem component, i.e. objective function in optimization or operator in VIs. Besides reproducing known results, our framework allows constructing new methods, which we illustrate by constructing a universal conditional gradient method and a universal method for VIs with a composite structure. This method works for smooth and non-smooth problems with optimal complexity without a priori knowledge of the problem's smoothness. As a particular case of our general framework, we introduce relative smoothness for operators and propose an algorithm for VIs with such operators. We also generalize our framework for relatively strongly convex objectives and strongly monotone VIs.

5 July 2022 in Journal of Optimization Theory and Applications
Verified
Journal Article
Closed access
PDF file
FSFedor Stonyakin
Fedor Stonyakin
AGAlexander Gasnikov
Alexander Gasnikov
PDPavel Dvurechensky
Pavel Dvurechensky
ATAlexander Titov
Alexander Titov
MAMohammad Alkousa
Mohammad Alkousa

1 November 2020 in Computational Mathematics and Mathematical Physics
Verified
Journal Article
Closed access
PDF file
MAMohammad Alkousa
Mohammad Alkousa
AGAlexander Gasnikov
Alexander Gasnikov
DDD. M. Dvinskikh
D. M. Dvinskikh
DKD. A. Kovalev
D. A. Kovalev
FSF. S. Stonyakin
F. S. Stonyakin
Recently, it has been shown how, on the basis of the usual accelerated gradient method for solving problems of smooth convex optimization, accelerated methods for more complex problems (with a structure) and problems that are solved using various local information about the behavior of a function (stochastic gradient, Hessian, etc.) can be obtained. The term “accelerated methods” here means, on the one hand, the presence of some unified and fairly general way of acceleration. On the other hand, this also means the optimality of the methods, which can often be proved rigorously. In the present work, an attempt is made to construct in the same way a theory of accelerated methods for solving smooth convex-concave saddle-point problems with a structure. The main result of this article is the obtainment of in some sense necessary and sufficient conditions under which the complexity of solving nonlinear convex-concave saddle-point problems with a structure in the number of calculations of the gradients of composites in direct variables is equal in order of magnitude to the complexity of solving bilinear problems with a structure.

21 September 2021
Verified
Book Chapter
Closed access
PDF file
EGEgor Gladin
Egor Gladin
ASAbdurakhmon Sadiev
Abdurakhmon Sadiev
AGAlexander Gasnikov
Alexander Gasnikov
PDPavel Dvurechensky
Pavel Dvurechensky
ABAleksandr Beznosikov
Aleksandr Beznosikov
MAMohammad Alkousa
Mohammad Alkousa