All issues
- 2024 Vol. 16
- 2023 Vol. 15
- 2022 Vol. 14
- 2021 Vol. 13
- 2020 Vol. 12
- 2019 Vol. 11
- 2018 Vol. 10
- 2017 Vol. 9
- 2016 Vol. 8
- 2015 Vol. 7
- 2014 Vol. 6
- 2013 Vol. 5
- 2012 Vol. 4
- 2011 Vol. 3
- 2010 Vol. 2
- 2009 Vol. 1
Primary affiliation
- Moscow Institute of Physics and Technology - Leading Researcher
- 9 Institutskiy lane, Dolgoprudny, Moscow region, 141700, Russia
- https://mipt.ru
The author's profile in the scientific and bibliometric databases
Biographical information
F.S. Stonyakin was born in Leningrad in 1987. He graduated from the Faculty of Mathematics and Information Science of the Vernadsky Taurian National University (now, Vernadsky Crimean Federal University (CFU) in 2009. Since graduation he has been working in the Department of Algebra and Functional Analysis of CFU. He received his Candidate’s degree in physics and mathematics (2011) and obtained a doctoral degree in physics and mathematics (2020), majoring in computational mathematics. From 2018 to 2020, F.S. Stonyakin worked in parallel as senior research worker at the Moscow Institute of Physics and Technology (MIPT) (National Reseach University). Since June 2021, he has been senior research worker at the Laboratory of Advanced Combinatorics and Network Applications of MIPT. In October 2021 he was appointed leading research worker in his primary place of employment.
Scientific interests
Main accomplishments of the author
F.S. Stonyakin has written more than 50 papers published in journals indexed in Scopus, of which 15 were published in journals of quartiles 1 or 2. Also, he has written 2 monographs and prepared a teaching guide on convex optimization (https://arxiv.org/pdf/2106.01946.pdf) together with E.A. Vorontsova, R.F. Hildebrand and A.V. Gasnikov. Altogether, F.S. Stonyakin has 60 scientific papers to his credit.
Additional information
Associate editor.
The author is ready to participate in reviewing.
Affiliations
Journal publications:
- Puchinin S.M., Korolkov E.R., Stonyakin F.S., Alkousa M.S., Vyguzov A.A. Subgradient methods with B.T. Polyak-type step for quasiconvex minimization problems with inequality constraints and analogs of the sharp minimum, Computer Research and Modeling, 2024, vol. 16, no. 1, pp. 105-122
- Stonyakin F.S., Savchuk O.S., Baran I.V., Alkousa M.S., Titov A.A. Analogues of the relative strong convexity condition for relatively smooth problems and adaptive gradient-type methods, Computer Research and Modeling, 2023, vol. 15, no. 2, pp. 413-432
- Stonyakin F.S., Ablaev S.S., Baran I.V., Alkousa M.S. Subgradient methods for weakly convex and relatively weakly convex problems with a sharp minimum, Computer Research and Modeling, 2023, vol. 15, no. 2, pp. 393-412
- Ablaev S.S., Makarenko D.V., Stonyakin F.S., Alkousa M.S., Baran I.V. Subgradient methods for non-smooth optimization problems with some relaxation of sharp minimum, Computer Research and Modeling, 2022, vol. 14, no. 2, pp. 473-495
- Savchuk O.S., Titov A.A., Stonyakin F.S., Alkousa M.S. Adaptive first-order methods for relatively strongly convex optimization problems, Computer Research and Modeling, 2022, vol. 14, no. 2, pp. 445-472
- Stonyakin F.S., Stepanov A.N., Gasnikov A.V., Titov A.A. Mirror descent for constrained optimization problems with large subgradient values of functional constraints, Computer Research and Modeling, 2020, vol. 12, no. 2, pp. 301-317
- Pasechnyuk D.A., Stonyakin F.S. One method for minimization a convex Lipschitz-continuous function of two variables on a fixed square, Computer Research and Modeling, 2019, vol. 11, no. 3, pp. 379-395
Indexed in Scopus
Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU
The journal is included in the Russian Science Citation Index
The journal is included in the RSCI
International Interdisciplinary Conference "Mathematics. Computing. Education"