Anastasia Bayandina
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
Anastasia Bayandina has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Gasnikov
Moscow Institute of Physics and Technology
4 shared publications - Evgenia Gasnikova
Laboratory of Structural Analysis Methods in Predictive Simulation, Moscow Institute of Physics and Technology
2 shared publications - Sergey Matsievsky
Kant Baltic Federal University
2 shared publications A. A. Lagunovskaya
Moscow Institute of Physics and Technology (National Research University)
1 shared publicationA. V. Gasnikov
Moscow Institute of Physics and Technology (National Research University)
1 shared publication- Alexander Titov
Moscow Institute of Physics and Technology Moscow Russia
1 shared publication
Latest Publications
- 1 November 2018
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 58 (11) , 1728-1736
Primal–Dual Mirror Descent Method for Constraint Stochastic Optimization Problems
Extension of the mirror descent method developed for convex stochastic optimization problems to constrained convex stochastic optimization problems (subject to functional inequality...
- 1 November 2018
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 58 (11) , 1728-1736
Primal–Dual Mirror Descent Method for Constraint Stochastic Optimization Problems
Extension of the mirror descent method developed for convex stochastic optimization problems to constrained convex stochastic optimization problems (subject to functional inequality...
- 14 August 2018
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 79 (8) , 1399-1408
Gradient-Free Two-Point Methods for Solving Stochastic Nonsmooth Convex Optimization Problems with Small Non-Random Noises
We study nonsmooth convex stochastic optimization problems with a two-point zero-order oracle, i.e., at each iteration one can observe the values of the function’s realization at two selected points....
- 14 August 2018
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 79 (8) , 1399-1408
Gradient-Free Two-Point Methods for Solving Stochastic Nonsmooth Convex Optimization Problems with Small Non-Random Noises
We study nonsmooth convex stochastic optimization problems with a two-point zero-order oracle, i.e., at each iteration one can observe the values of the function’s realization at two selected points....
- Open Access
Mirror Descent and Convex Optimization Problems With Non-Smooth Inequality Constraints
We consider the problem of minimization of a convex function on a simple set with convex non-smooth inequality constraint and describe first-order methods to solve such problems in different situations: smooth or non-smooth objective function; convex or strongly convex objective and constraint; deterministic or randomized information about the objective and constraint. We hope that it is convenient for a reader to have all the methods for different settings in one place. Described methods are based on Mirror Descent algorithm and switching subgradient scheme. One of our focus is to propose, for the listed different settings, a Mirror Descent with adaptive stepsizes and adaptive stopping rule. This means that neither stepsize nor stopping rule require to know the Lipschitz constant of the objective or constraint. We also construct Mirror Descent for problems with objective function, which is not Lipschitz continuous, e.g. is a quadratic function. Besides that, we address the problem of recovering the solution of the dual problem.
Open AccessMirror Descent and Convex Optimization Problems With Non-Smooth Inequality Constraints
We consider the problem of minimization of a convex function on a simple set with convex non-smooth inequality constraint and describe first-order methods to solve such problems in different situations: smooth or non-smooth objective function; convex or strongly convex objective and constraint; deterministic or randomized information about the objective and constraint. We hope that it is convenient for a reader to have all the methods for different settings in one place. Described methods are based on Mirror Descent algorithm and switching subgradient scheme. One of our focus is to propose, for the listed different settings, a Mirror Descent with adaptive stepsizes and adaptive stopping rule. This means that neither stepsize nor stopping rule require to know the Lipschitz constant of the objective or constraint. We also construct Mirror Descent for problems with objective function, which is not Lipschitz continuous, e.g. is a quadratic function. Besides that, we address the problem of recovering the solution of the dual problem.
- Open Access
Gradient-free two-points optimal method for non smooth stochastic convex optimization problem with additional small noise
Using double-smoothing technique and stochastic mirror descent with inexact oracle we built an optimal algorithm (up to a multiplicative factor) for two-points gradient-free non-smooth stochastic convex programming. We investigate how much can be the level of noise (the nature of this noise isn't necessary stochastic) for the rate of convergence to be maintained (up to a multiplicative factor).
Open AccessGradient-free two-points optimal method for non smooth stochastic convex optimization problem with additional small noise
Using double-smoothing technique and stochastic mirror descent with inexact oracle we built an optimal algorithm (up to a multiplicative factor) for two-points gradient-free non-smooth stochastic convex programming. We investigate how much can be the level of noise (the nature of this noise isn't necessary stochastic) for the rate of convergence to be maintained (up to a multiplicative factor).
- Open Access
Primal-dual mirror descent for the stochastic programming problems with functional constraints
We propose primal-dual stochastic mirror descent for the convex optimization problems with functional constraints. We obtain the rate of convergence in terms of probability of large deviations.
Open AccessPrimal-dual mirror descent for the stochastic programming problems with functional constraints
We propose primal-dual stochastic mirror descent for the convex optimization problems with functional constraints. We obtain the rate of convergence in terms of probability of large deviations.
- Open Access
Adaptive Mirror Descent for Constrained Optimization
This paper seeks to address how to solve non-smooth convex and strongly convex optimization problems with functional constraints. The introduced Mirror Descent (MD) method with adaptive stepsizes is shown to have a better convergence rate than MD with fixed stepsizes due to the improved constant. For certain types of constraints, the method is proved to generate dual solution. For the strongly convex case, the restart technique is applied.
Open AccessAdaptive Mirror Descent for Constrained Optimization
This paper seeks to address how to solve non-smooth convex and strongly convex optimization problems with functional constraints. The introduced Mirror Descent (MD) method with adaptive stepsizes is shown to have a better convergence rate than MD with fixed stepsizes due to the improved constant. For certain types of constraints, the method is proved to generate dual solution. For the strongly convex case, the restart technique is applied.