Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Mohammad S. Alkousa"'
Autor:
Mohammad S. Alkousa
Publikováno v:
Компьютерные исследования и моделирование, Vol 11, Iss 2, Pp 205-217 (2019)
The problem of online convex optimization naturally occurs in cases when there is an update of statistical information. The mirror descent method is well known for non-smooth optimization problems. Mirror descent is an extension of the subgradient me
Externí odkaz:
https://doaj.org/article/e908f3e284be4b47ad969a9445ec7c3b
Autor:
Fedor Sergeevich Stonyakin, Olеg S Savchuk, Inna V Baran, Mohammad S. Alkousa, Alexander A Titov
Publikováno v:
Computer Research and Modeling. 15:413-432
Publikováno v:
Computer Research and Modeling. 15:393-412
Publikováno v:
Computer Research and Modeling. 14:445-472
Autor:
Fedor Sergeevich Stonyakin, Aleksandr Aleksandrovich Titov, D V Makarenko, Mohammad S Alkousa
Publikováno v:
Matematicheskie Zametki. 112:879-894
Статья посвящена существенному расширению недавно предложенного класса относительно сильно выпуклых оптимизационных задач в простра
Autor:
Seydamet S. Ablaev, Alexander A. Titov, Fedor S. Stonyakin, Mohammad S. Alkousa, Alexander Gasnikov
Publikováno v:
Optimization and Applications ISBN: 9783031225420
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::027172a568fc80726ae26346a8c30cf8
https://doi.org/10.1007/978-3-031-22543-7_10
https://doi.org/10.1007/978-3-031-22543-7_10
Publikováno v:
Communications in Computer and Information Science ISBN: 9783031229893
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d42b6d26d0b19de2434659aa4415ac21
https://doi.org/10.1007/978-3-031-22990-9_2
https://doi.org/10.1007/978-3-031-22990-9_2