Mohammad S. Alkousa
Mohammad S. Alkousa
MIPT, HSE
Verified email at phystech.edu
Title
Cited by
Cited by
Year
Accelerated methods for composite non-bilinear saddle point problem
M Alkousa, D Dvinskikh, F Stonyakin, A Gasnikov, D Kovalev
arXiv preprint arXiv:1906.03620, 2019
132019
Inexact relative smoothness and strong convexity for optimization and variational inequalities by inexact model
F Stonyakin, A Tyurin, A Gasnikov, P Dvurechensky, A Agafonov, ...
arXiv preprint arXiv:2001.09013, 2020
102020
Mirror descent and constrained online optimization problems
AA Titov, FS Stonyakin, AV Gasnikov, MS Alkousa
International Conference on Optimization and Applications, 64-78, 2018
92018
Adaptive mirror descent algorithms in convex programming problems with Lipschitz constraints
FS Stonyakin, MS Alkousa, AN Stepanov, MA Barinov
Trudy Instituta Matematiki i Mekhaniki URO RAN 24 (2), 266-279, 2018
82018
New version of mirror prox for variational inequalities with adaptation to inexactness
FS Stonyakin, EA Vorontsova, MS Alkousa
International Conference on Optimization and Applications, 427-442, 2019
72019
Generalized mirror prox for monotone variational inequalities: Universality and inexact oracle
F Stonyakin, A Gasnikov, P Dvurechensky, M Alkousa, A Titov
arXiv preprint arXiv:1806.05140, 2018
62018
Accelerated Methods for Saddle-Point Problem
MS Alkousa, AV Gasnikov, DM Dvinskikh, DA Kovalev, FS Stonyakin
Computational Mathematics and Mathematical Physics 60 (11), 1787-1809, 2020
42020
Adaptive mirror descent algorithms for convex and strongly convex optimization problems with functional constraints
FS Stonyakin, M Alkousa, AN Stepanov, AA Titov
Journal of Applied and Industrial Mathematics 13 (3), 557-574, 2019
42019
On some stochastic mirror descent methods for constrained online optimization problems
MS Alkousa
Компьютерные исследования и моделирование 11 (2), 205-217, 2019
42019
On some methods for strongly convex optimization problems with one functional constraint
FS Stonyakin, MS Alkousa, AA Titov, VV Piskunova
International Conference on Mathematical Optimization Theory and Operations …, 2019
32019
Solving strongly convex-concave composite saddle point problems with a small dimension of one of the variables
E Gladin, I Kuruzov, F Stonyakin, D Pasechnyuk, M Alkousa, A Gasnikov
arXiv preprint arXiv:2010.02280, 2020
22020
Solving smooth min-min and min-max problems by mixed oracle algorithms
E Gladin, A Sadiev, A Gasnikov, P Dvurechensky, A Beznosikov, ...
arXiv preprint arXiv:2103.00434, 2021
12021
Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems
AA Titov, FS Stonyakin, MS Alkousa, SS Ablaev, AV Gasnikov
International Conference on Mathematical Optimization Theory and Operations …, 2020
12020
On Modification of an Adaptive Stochastic Mirror Descent Algorithm for Convex Optimization Problems with Functional Constraints
MS Alkousa
Computational Mathematics and Applications, 47-63, 2020
12020
Algorithms for solving variational inequalities and saddle point problems with some generalizations of Lipschitz property for operators
A Titov, F Stonyakin, M Alkousa, A Gasnikov
arXiv preprint arXiv:2103.00961, 2021
2021
On solving convex min-min problems with smoothness and strong convexity in one variable group and small dimension of the other
E Gladin, M Alkousa, A Gasnikov
arXiv preprint arXiv:2102.00584, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–16