Seydamet S. Ablaev
Research Subjects
Seydamet S. Ablaev has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Fedor Sergeevich Stonyakin
Moscow Institute of Physics and Technology
9 shared publications - Mohammad Alkousa
Innopolis University, Innopolis, Russia
8 shared publications - Alexander Gasnikov
Moscow Institute of Physics and Technology
3 shared publications - Alexander Titov
Moscow Institute of Physics and Technology Moscow Russia
3 shared publications - Dmitry Arkad'EVich Pasechnyuk
Mohamed Zayed University of Artificial Intelligence Abu Dhabi UAE
2 shared publications - I. V. Baran
Vernadsky Crimean Federal University, Simferopol, Russia
2 shared publications
Latest Publications
- 1 December 2023
- Published by Pleiades Publishing Ltd in Proceedings of the Steklov Institute of Mathematics
- Vol. 323 (S1) , S1-S18
Adaptive Subgradient Methods for Mathematical Programming Problems with Quasiconvex Functions
The paper is devoted to subgradient methods with switching between productive and nonproductive steps for problems of minimization of quasiconvex functions under functional inequality constraints. For the problem of minimizing a convex function with quasiconvex inequality constraints, a result is obtained on the convergence of the subgradient method with an adaptive stopping rule. Further, based on an analog of a sharp minimum for nonlinear problems with inequality constraints, results are obtained on the geometric convergence of restarted versions of subgradient methods. Such results are considered separately in the case of a convex objective function and quasiconvex inequality constraints, as well as in the case of a quasiconvex objective function and convex inequality constraints. The convexity may allow to additionally suggest adaptive stopping rules for auxiliary methods, which guarantee that an acceptable solution quality is achieved. The results of computational experiments are presented, showing the advantages of using such stopping rules.
- 1 December 2023
- Published by Pleiades Publishing Ltd in Proceedings of the Steklov Institute of Mathematics
- Vol. 323 (S1) , S1-S18
Adaptive Subgradient Methods for Mathematical Programming Problems with Quasiconvex Functions
The paper is devoted to subgradient methods with switching between productive and nonproductive steps for problems of minimization of quasiconvex functions under functional inequality constraints. For the problem of minimizing a convex function with quasiconvex inequality constraints, a result is obtained on the convergence of the subgradient method with an adaptive stopping rule. Further, based on an analog of a sharp minimum for nonlinear problems with inequality constraints, results are obtained on the geometric convergence of restarted versions of subgradient methods. Such results are considered separately in the case of a convex objective function and quasiconvex inequality constraints, as well as in the case of a quasiconvex objective function and convex inequality constraints. The convexity may allow to additionally suggest adaptive stopping rules for auxiliary methods, which guarantee that an acceptable solution quality is achieved. The results of computational experiments are presented, showing the advantages of using such stopping rules.
- 1 December 2023
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 49 (6) , 485-492
Adaptive Methods for Variational Inequalities with Relatively Smooth and Reletively Strongly Monotone Operators
This paper is devoted to some adaptive methods for variational inequalities with relatively smooth and relatively strongly monotone operators. Based on the recently proposed proximal version of the extragradient method for this class of problems, we study in detail the method with adaptively selected parameter values. The rate of convergence of this method is estimated. The result is generalized to the class of variational inequalities with relatively strongly monotone δ-generalized smooth operators. For the ridge regression problem and variational inequality associated with box-simplex games, numerical experiments are carried out to demonstrate the effectiveness of the proposed technique for adaptive parameter selection during the execution of the algorithm.
- 1 December 2023
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 49 (6) , 485-492
Adaptive Methods for Variational Inequalities with Relatively Smooth and Reletively Strongly Monotone Operators
This paper is devoted to some adaptive methods for variational inequalities with relatively smooth and relatively strongly monotone operators. Based on the recently proposed proximal version of the extragradient method for this class of problems, we study in detail the method with adaptively selected parameter values. The rate of convergence of this method is estimated. The result is generalized to the class of variational inequalities with relatively strongly monotone δ-generalized smooth operators. For the ridge regression problem and variational inequality associated with box-simplex games, numerical experiments are carried out to demonstrate the effectiveness of the proposed technique for adaptive parameter selection during the execution of the algorithm.
- 1 November 2023
- Published by The Russian Academy of Sciences in Программирование
- No. 6,p. 5-13
Adaptive Methods or Variational Inequalities with Relatively Smooth and Reletively Strongly Monotone Operators
The article is devoted to some adaptive methods for variational inequalities with relatively smooth and relatively strongly monotone operators. Based on the recently proposed proximal version of the extragradient method for this class of problems, we study in detail the method with adaptively selected parameter values. An estimate for the rate of convergence of this method is proved. The result is generalized to a class of variational inequalities with relatively strongly monotone δ-generalized smooth variational inequality operators. For the problem of ridge regression and variational inequality associated with box-simplex games, numerical experiments were performed demonstrating the effectiveness of the proposed method of adaptive selection of parameters during the running of the algorithm.
- 1 November 2023
- Published by The Russian Academy of Sciences in Программирование
- No. 6,p. 5-13
Adaptive Methods or Variational Inequalities with Relatively Smooth and Reletively Strongly Monotone Operators
The article is devoted to some adaptive methods for variational inequalities with relatively smooth and relatively strongly monotone operators. Based on the recently proposed proximal version of the extragradient method for this class of problems, we study in detail the method with adaptively selected parameter values. An estimate for the rate of convergence of this method is proved. The result is generalized to a class of variational inequalities with relatively strongly monotone δ-generalized smooth variational inequality operators. For the problem of ridge regression and variational inequality associated with box-simplex games, numerical experiments were performed demonstrating the effectiveness of the proposed method of adaptive selection of parameters during the running of the algorithm.
- 1 September 2023
- Published by Krasovskii Institute of Mathematics and Mechanics UB RAS in Trudy Instituta Matematiki i Mekhaniki UrO RAN
- Vol. 29 (3) , 7-25
Адаптивные субградиентные методы для задач математического программирования с квазивыпуклыми функциями
- 1 September 2023
- Published by Krasovskii Institute of Mathematics and Mechanics UB RAS in Trudy Instituta Matematiki i Mekhaniki UrO RAN
- Vol. 29 (3) , 7-25
Адаптивные субградиентные методы для задач математического программирования с квазивыпуклыми функциями
- Open Access
Adaptive Methods or Variational Inequalities with Relatively Smooth and Reletively Strongly Monotone Operators
The article is devoted to some adaptive methods for variational inequalities with relatively smooth and relatively strongly monotone operators. Starting from the recently proposed proximal variant of the extragradient method for this class of problems, we investigate in detail the method with adaptively selected parameter values. An estimate of the convergence rate of this method is proved. The result is generalized to a class of variational inequalities with relatively strongly monotone generalized smooth variational inequality operators. Numerical experiments have been performed for the problem of ridge regression and variational inequality associated with box-simplex games.
Open AccessAdaptive Methods or Variational Inequalities with Relatively Smooth and Reletively Strongly Monotone Operators
The article is devoted to some adaptive methods for variational inequalities with relatively smooth and relatively strongly monotone operators. Starting from the recently proposed proximal variant of the extragradient method for this class of problems, we investigate in detail the method with adaptively selected parameter values. An estimate of the convergence rate of this method is proved. The result is generalized to a class of variational inequalities with relatively strongly monotone generalized smooth variational inequality operators. Numerical experiments have been performed for the problem of ridge regression and variational inequality associated with box-simplex games.
- Open Access
Subgradient methods for non-smooth optimization problems with some relaxation of sharp minimum
In this paper we propose a generalized condition for a sharp minimum, somewhat similar to the inexact oracle proposed recently by Devolder-Glineur-Nesterov. The proposed approach makes it possible to extend the class of applicability of subgradient methods with the Polyak step-size, to the situation of inexact information about the value of the minimum, as well as the unknown Lipschitz constant of the objective function. Moreover, the use of local analogs of the global characteristics of the objective function makes it possible to apply the results of this type to wider classes of problems. We show the possibility of applying the proposed approach to strongly convex non-smooth problems, also, we make an experimental comparison with the known optimal subgradient method for such a class of problems. Moreover, there were obtained some results connected to the applicability of the proposed technique to some types of problems with convexity relaxations: the recently proposed notion of weak $\beta$-quasi-convexity and ordinary quasi-convexity. Also in the paper, we study a generalization of the described technique to the situation with the assumption that the $\delta$-subgradient of the objective function is available instead of the usual subgradient. For one of the considered methods, conditions are found under which, in practice, it is possible to escape the projection of the considered iterative sequence onto the feasible set of the problem.
Open AccessSubgradient methods for non-smooth optimization problems with some relaxation of sharp minimum
In this paper we propose a generalized condition for a sharp minimum, somewhat similar to the inexact oracle proposed recently by Devolder-Glineur-Nesterov. The proposed approach makes it possible to extend the class of applicability of subgradient methods with the Polyak step-size, to the situation of inexact information about the value of the minimum, as well as the unknown Lipschitz constant of the objective function. Moreover, the use of local analogs of the global characteristics of the objective function makes it possible to apply the results of this type to wider classes of problems. We show the possibility of applying the proposed approach to strongly convex non-smooth problems, also, we make an experimental comparison with the known optimal subgradient method for such a class of problems. Moreover, there were obtained some results connected to the applicability of the proposed technique to some types of problems with convexity relaxations: the recently proposed notion of weak $\beta$-quasi-convexity and ordinary quasi-convexity. Also in the paper, we study a generalization of the described technique to the situation with the assumption that the $\delta$-subgradient of the objective function is available instead of the usual subgradient. For one of the considered methods, conditions are found under which, in practice, it is possible to escape the projection of the considered iterative sequence onto the feasible set of the problem.
- 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.
- 1 January 2022
- Published by Springer Nature
- p. 135-150
Some Adaptive First-Order Methods for Variational Inequalities with Relatively Strongly Monotone Operators and Generalized Smoothness
- 1 January 2022
- Published by Springer Nature
- p. 135-150
Some Adaptive First-Order Methods for Variational Inequalities with Relatively Strongly Monotone Operators and Generalized Smoothness
- 1 January 2021
- Published by Krasovskii Institute of Mathematics and Mechanics UB RAS in Trudy Instituta Matematiki i Mekhaniki UrO RAN
- Vol. 27 (4) , 175-188
Adaptive gradient-type methods for optimization problems with relative error and sharp minimum
A universal method of gradient type for convex minimization problems with relative error is studied, and new results on the linear convergence rate of specific versions of the subgradient method for problems with a sharp minimum and some generalizations of convexity are obtained. A new approach to the choice of parameters and the stopping rule of an adaptive version of the method of similar triangles on a class of minimization problems for convex positively homogeneous functionals is proposed. As a consequence, an analog of the universal gradient method for problems with relative error is obtained and an optimal estimate of its convergence rate on a chosen class of problems is proved. An example of the results of numerical experiments illustrating the possibility of improving the quality of the approximate solution produced by the method as compared to a theoretical estimate due to the introduced adaptive stopping rule is given. A version of the subgradient method for minimization problems with weakly beta-quasiconvex Lipschitz-continuous functionals in the case of a sharp minimum is considered, and a linear convergence rate is proved. Finally, a version of the subgradient method is proposed that converges at a linear rate on a class of problems of minimizing quasiconvex Holder-continuous functionals with a sharp minimum. The applicability of this result for functionals with a weak sharp minimum (Holderian growth) is shown and a corollary of this result is formulated for problems with relative error.
- 1 January 2021
- Published by Krasovskii Institute of Mathematics and Mechanics UB RAS in Trudy Instituta Matematiki i Mekhaniki UrO RAN
- Vol. 27 (4) , 175-188
Adaptive gradient-type methods for optimization problems with relative error and sharp minimum
A universal method of gradient type for convex minimization problems with relative error is studied, and new results on the linear convergence rate of specific versions of the subgradient method for problems with a sharp minimum and some generalizations of convexity are obtained. A new approach to the choice of parameters and the stopping rule of an adaptive version of the method of similar triangles on a class of minimization problems for convex positively homogeneous functionals is proposed. As a consequence, an analog of the universal gradient method for problems with relative error is obtained and an optimal estimate of its convergence rate on a chosen class of problems is proved. An example of the results of numerical experiments illustrating the possibility of improving the quality of the approximate solution produced by the method as compared to a theoretical estimate due to the introduced adaptive stopping rule is given. A version of the subgradient method for minimization problems with weakly beta-quasiconvex Lipschitz-continuous functionals in the case of a sharp minimum is considered, and a linear convergence rate is proved. Finally, a version of the subgradient method is proposed that converges at a linear rate on a class of problems of minimizing quasiconvex Holder-continuous functionals with a sharp minimum. The applicability of this result for functionals with a weak sharp minimum (Holderian growth) is shown and a corollary of this result is formulated for problems with relative error.
- 14 September 2020
- Published by Springer Nature
- p. 133-149
Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems
- 14 September 2020
- Published by Springer Nature
- p. 133-149
Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems