Alexander Titov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alexander Titov has a total of 58 co-authors. Here are the top co-authors by number of shared publications:
- Fedor Sergeevich Stonyakin
Moscow Institute of Physics and Technology
19 shared publications - Mohammad Alkousa
Innopolis University, Innopolis, Russia
16 shared publications - Alexander Gasnikov
Moscow Institute of Physics and Technology
10 shared publications - Pavel Dvurechensky
Weierstrass Institute for Applied Analysis and Stochastics Mohrenstr. 39 10117 Berlin Germany
5 shared publications - Igor Vladimirovich Nagornov
Южно-уральский государственный гуманитарно-педагогический университет
4 shared publications - Seydamet S. Ablaev
VI Vernadsky Crimean Fed Univ, Simferopol 295007, Republic Of Cri, Russia
3 shared publications
Latest Publications
- Open Access
- 31 October 2024
- Published by Novosibirsk State Pedagogical University in Science for Education Today
- Vol. 14 (5) , 96-113
Preparing future primary school teachers to solve the problem of historical education of primary schoolchildren with the main focus on the formation of historical memory: Methodological and tech-nological aspects
Introduction. The article deals with the problem of preparing future teachers for delivering historical education and the formation of historical memory in primary schoolchildren. The purpose of the article is to clarify methodological and technological aspects of preparing future primary school teachers to solve the problem of historical education of primary schoolchildren with the main focus on the formation of historical memory. Materials and Methods. The study follows the value-semantic approach. The research methods employed include the survey, the unfinished sentence method, statistical methods and content analysis. Results. The authors summarized the existing theoretical research on this problem, identified the level of future teachers’ awareness about the history of our country, justified the need to apply a value-semantic approach to the process of preparing students for delivering historical education in primary school with the main focus on the formation of historical memory, and proposed ways of preparing students for delivering historical education. Conclusions. The authors conclude that the preparation of future teachers for historical education with the main focus on the formation of historical memory among students should be carried out on the basis of a value-semantic approach. The basis of readiness for the implementation of this process is high level of teachers’ awareness about the history of our country, as well as their understanding and practical application of the mechanism of historical education in conjunction with the formation of historical memory.
- 31 October 2024
- Published by Novosibirsk State Pedagogical University in Science for Education Today
- Vol. 14 (5) , 96-113
Open AccessPreparing future primary school teachers to solve the problem of historical education of primary schoolchildren with the main focus on the formation of historical memory: Methodological and tech-nological aspects
Introduction. The article deals with the problem of preparing future teachers for delivering historical education and the formation of historical memory in primary schoolchildren. The purpose of the article is to clarify methodological and technological aspects of preparing future primary school teachers to solve the problem of historical education of primary schoolchildren with the main focus on the formation of historical memory. Materials and Methods. The study follows the value-semantic approach. The research methods employed include the survey, the unfinished sentence method, statistical methods and content analysis. Results. The authors summarized the existing theoretical research on this problem, identified the level of future teachers’ awareness about the history of our country, justified the need to apply a value-semantic approach to the process of preparing students for delivering historical education in primary school with the main focus on the formation of historical memory, and proposed ways of preparing students for delivering historical education. Conclusions. The authors conclude that the preparation of future teachers for historical education with the main focus on the formation of historical memory among students should be carried out on the basis of a value-semantic approach. The basis of readiness for the implementation of this process is high level of teachers’ awareness about the history of our country, as well as their understanding and practical application of the mechanism of historical education in conjunction with the formation of historical memory.
- 30 May 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 90 (2) , 373-399
Optimization in complex spaces with the mixed Newton method
- 30 May 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 90 (2) , 373-399
Optimization in complex spaces with the mixed Newton method
- Open Access
Adaptive Algorithms for Relatively Lipschitz Continuous Convex Optimization Problems
Recently there were proposed some innovative convex optimization concepts, namely, relative smoothness [1] and relative strong convexity [2,3]. These approaches have significantly expanded the class of applicability of gradient-type methods with optimal estimates of the convergence rate, which are invariant regardless of the dimensionality of the problem. Later Yu. Nesterov and H. Lu introduced some modifications of the Mirror Descent method for convex minimization problems with the corresponding analogue of the Lipschitz condition (so-called relative Lipschitz continuity). By introducing an artificial inaccuracy to the optimization model, we propose adaptive methods for minimizing a convex Lipschitz continuous function, as well as for the corresponding class of variational inequalities. We also consider an adaptive "universal" method, applicable to convex minimization problems both on the class of relatively smooth and relatively Lipschitz continuous functionals with optimal estimates of the convergence rate. The universality of the method makes it possible to justify the applicability of the obtained theoretical results to a wider class of convex optimization problems. We also present the results of numerical experiments.
Open AccessAdaptive Algorithms for Relatively Lipschitz Continuous Convex Optimization Problems
Recently there were proposed some innovative convex optimization concepts, namely, relative smoothness [1] and relative strong convexity [2,3]. These approaches have significantly expanded the class of applicability of gradient-type methods with optimal estimates of the convergence rate, which are invariant regardless of the dimensionality of the problem. Later Yu. Nesterov and H. Lu introduced some modifications of the Mirror Descent method for convex minimization problems with the corresponding analogue of the Lipschitz condition (so-called relative Lipschitz continuity). By introducing an artificial inaccuracy to the optimization model, we propose adaptive methods for minimizing a convex Lipschitz continuous function, as well as for the corresponding class of variational inequalities. We also consider an adaptive "universal" method, applicable to convex minimization problems both on the class of relatively smooth and relatively Lipschitz continuous functionals with optimal estimates of the convergence rate. The universality of the method makes it possible to justify the applicability of the obtained theoretical results to a wider class of convex optimization problems. We also present the results of numerical experiments.
- Open Access
Algorithms for solving variational inequalities and saddle point problems with some generalizations of Lipschitz property for operators
The article is devoted to the development of numerical methods for solving saddle point problems and variational inequalities with simplified requirements for the smoothness conditions of functionals. Recently there were proposed some notable methods for optimization problems with strongly monotone operators. Our focus here is on newly proposed techniques for solving strongly convex-concave saddle point problems. One of the goals of the article is to improve the obtained estimates of the complexity of introduced algorithms by using accelerated methods for solving auxiliary problems. The second focus of the article is introducing an analogue of the boundedness condition for the operator in the case of arbitrary (not necessarily Euclidean) prox structure. We propose an analogue of the mirror descent method for solving variational inequalities with such operators, which is optimal in the considered class of problems.
Open AccessAlgorithms for solving variational inequalities and saddle point problems with some generalizations of Lipschitz property for operators
The article is devoted to the development of numerical methods for solving saddle point problems and variational inequalities with simplified requirements for the smoothness conditions of functionals. Recently there were proposed some notable methods for optimization problems with strongly monotone operators. Our focus here is on newly proposed techniques for solving strongly convex-concave saddle point problems. One of the goals of the article is to improve the obtained estimates of the complexity of introduced algorithms by using accelerated methods for solving auxiliary problems. The second focus of the article is introducing an analogue of the boundedness condition for the operator in the case of arbitrary (not necessarily Euclidean) prox structure. We propose an analogue of the mirror descent method for solving variational inequalities with such operators, which is optimal in the considered class of problems.
- 21 September 2023
- Published by Springer Nature
- p. 29-43
Online Optimization Problems with Functional Constraints Under Relative Lipschitz Continuity and Relative Strong Convexity Conditions
- 21 September 2023
- Published by Springer Nature
- p. 29-43
Online Optimization Problems with Functional Constraints Under Relative Lipschitz Continuity and Relative Strong Convexity Conditions
- 30 December 2022
- Published by Pleiades Publishing Ltd in Mathematical Notes
- Vol. 112 (5-6) , 965-977
Numerical Methods for Some Classes of Variational Inequalities with Relatively Strongly Monotone Operators
The paper deals with a significant extension of the recently proposed class of relatively strongly convex optimization problems in spaces of large dimension. In the present paper, we introduce an analog of the concept of relative strong convexity for variational inequalities (relative strong monotonicity) and study estimates for the rate of convergence of some numerical first-order methods for problems of this type. The paper discusses two classes of variational inequalities depending on the conditions related to the smoothness of the operator. The first of these classes of problems contains relatively bounded operators, and the second, operators with an analog of the Lipschitz condition (known as relative smoothness). For variational inequalities with relatively bounded and relatively strongly monotone operators, a version of the subgradient method is studied and an optimal estimate for the rate of convergence is justified. For problems with relatively smooth and relatively strongly monotone operators, we prove the linear rate of convergence of an algorithm with a special organization of the restart procedure of a mirror prox method for variational inequalities with monotone operators.
- 30 December 2022
- Published by Pleiades Publishing Ltd in Mathematical Notes
- Vol. 112 (5-6) , 965-977
Numerical Methods for Some Classes of Variational Inequalities with Relatively Strongly Monotone Operators
The paper deals with a significant extension of the recently proposed class of relatively strongly convex optimization problems in spaces of large dimension. In the present paper, we introduce an analog of the concept of relative strong convexity for variational inequalities (relative strong monotonicity) and study estimates for the rate of convergence of some numerical first-order methods for problems of this type. The paper discusses two classes of variational inequalities depending on the conditions related to the smoothness of the operator. The first of these classes of problems contains relatively bounded operators, and the second, operators with an analog of the Lipschitz condition (known as relative smoothness). For variational inequalities with relatively bounded and relatively strongly monotone operators, a version of the subgradient method is studied and an optimal estimate for the rate of convergence is justified. For problems with relatively smooth and relatively strongly monotone operators, we prove the linear rate of convergence of an algorithm with a special organization of the restart procedure of a mirror prox method for variational inequalities with monotone operators.
- Open Access
Some Adaptive First-order Methods for Variational Inequalities with Relatively Strongly Monotone Operators and Generalized Smoothness
In this paper, we introduce some adaptive methods for solving variational inequalities with relatively strongly monotone operators. Firstly, we focus on the modification of the recently proposed, in smooth case [1], adaptive numerical method for generalized smooth (with H\"older condition) saddle point problem, which has convergence rate estimates similar to accelerated methods. We provide the motivation for such an approach and obtain theoretical results of the proposed method. Our second focus is the adaptation of widespread recently proposed methods for solving variational inequalities with relatively strongly monotone operators. The key idea in our approach is the refusal of the well-known restart technique, which in some cases causes difficulties in implementing such algorithms for applied problems. Nevertheless, our algorithms show a comparable rate of convergence with respect to algorithms based on the above-mentioned restart technique. Also, we present some numerical experiments, which demonstrate the effectiveness of the proposed methods. [1] Jin, Y., Sidford, A., & Tian, K. (2022). Sharper rates for separable minimax and finite sum optimization via primal-dual extragradient methods. arXiv preprint arXiv:2202.04640.
Open AccessSome Adaptive First-order Methods for Variational Inequalities with Relatively Strongly Monotone Operators and Generalized Smoothness
In this paper, we introduce some adaptive methods for solving variational inequalities with relatively strongly monotone operators. Firstly, we focus on the modification of the recently proposed, in smooth case [1], adaptive numerical method for generalized smooth (with H\"older condition) saddle point problem, which has convergence rate estimates similar to accelerated methods. We provide the motivation for such an approach and obtain theoretical results of the proposed method. Our second focus is the adaptation of widespread recently proposed methods for solving variational inequalities with relatively strongly monotone operators. The key idea in our approach is the refusal of the well-known restart technique, which in some cases causes difficulties in implementing such algorithms for applied problems. Nevertheless, our algorithms show a comparable rate of convergence with respect to algorithms based on the above-mentioned restart technique. Also, we present some numerical experiments, which demonstrate the effectiveness of the proposed methods. [1] Jin, Y., Sidford, A., & Tian, K. (2022). Sharper rates for separable minimax and finite sum optimization via primal-dual extragradient methods. arXiv preprint arXiv:2202.04640.
- 5 July 2022
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 194 (3) , 988-1013
Generalized Mirror Prox Algorithm for Monotone Variational Inequalities: Universality and Inexact Oracle
- 5 July 2022
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 194 (3) , 988-1013
Generalized Mirror Prox Algorithm for Monotone Variational Inequalities: Universality and Inexact Oracle
- Open Access
Some Methods for Relatively Strongly Monotone Variational Inequalities
The article is devoted to the development of numerical methods for solving variational inequalities with relatively strongly monotone operators. We consider two classes of variational inequalities related to some analogs of the Lipschitz condition of the operator that appeared several years ago. One of these classes is associated with the relative boundedness of the operator, and the other one with the analog of the Lipschitz condition (namely, relative smoothness). For variational inequalities with relatively bounded and relatively strongly monotone operators, we introduce a modification of the Mirror Descent method, which optimizes the convergence rate. We also propose the adaptive Proximal Pirror algorithm and its restarted version with a linear convergence rate for problems with relatively smooth and relatively strongly monotone operators.
Open AccessSome Methods for Relatively Strongly Monotone Variational Inequalities
The article is devoted to the development of numerical methods for solving variational inequalities with relatively strongly monotone operators. We consider two classes of variational inequalities related to some analogs of the Lipschitz condition of the operator that appeared several years ago. One of these classes is associated with the relative boundedness of the operator, and the other one with the analog of the Lipschitz condition (namely, relative smoothness). For variational inequalities with relatively bounded and relatively strongly monotone operators, we introduce a modification of the Mirror Descent method, which optimizes the convergence rate. We also propose the adaptive Proximal Pirror algorithm and its restarted version with a linear convergence rate for problems with relatively smooth and relatively strongly monotone operators.
- Open Access
Generalized Mirror Prox for Monotone Variational Inequalities: Universality and Inexact Oracle
We introduce an inexact oracle model for variational inequalities (VI) with monotone operator, propose a numerical method which solves such VI's and analyze its convergence rate. As a particular case, we consider VI's with H\"older-continuous operator and show that our algorithm is universal. This means that without knowing the H\"older parameter $\nu$ and H\"older constant $L_{\nu}$ it has the best possible complexity for this class of VI's, namely our algorithm has complexity $O\left( \inf_{\nu\in[0,1]}\left(\frac{L_{\nu}}{\varepsilon} \right)^{\frac{2}{1+\nu}}R^2 \right)$, where $R$ is the size of the feasible set and $\varepsilon$ is the desired accuracy of the solution. We also consider the case of VI's with strongly monotone operator and generalize our method for VI's with inexact oracle and our universal method for this class of problems. Finally, we show, how our method can be applied to convex-concave saddle point problems with H\"older-continuous partial subgradients.Open AccessGeneralized Mirror Prox for Monotone Variational Inequalities: Universality and Inexact Oracle
We introduce an inexact oracle model for variational inequalities (VI) with monotone operator, propose a numerical method which solves such VI's and analyze its convergence rate. As a particular case, we consider VI's with H\"older-continuous operator and show that our algorithm is universal. This means that without knowing the H\"older parameter $\nu$ and H\"older constant $L_{\nu}$ it has the best possible complexity for this class of VI's, namely our algorithm has complexity $O\left( \inf_{\nu\in[0,1]}\left(\frac{L_{\nu}}{\varepsilon} \right)^{\frac{2}{1+\nu}}R^2 \right)$, where $R$ is the size of the feasible set and $\varepsilon$ is the desired accuracy of the solution. We also consider the case of VI's with strongly monotone operator and generalize our method for VI's with inexact oracle and our universal method for this class of problems. Finally, we show, how our method can be applied to convex-concave saddle point problems with H\"older-continuous partial subgradients.