| Publication | Date of Publication | Type |
|---|
Adaptive subgradient methods for mathematical programming problems with quasiconvex functions
Proceedings of the Steklov Institute of Mathematics | 2024-02-16 | Paper |
Subgradient methods with variants of Polyak step-size for quasi-convex optimization with inequality constraints for analogues of sharp minima
| 2023-12-12 | Paper |
Adaptive algorithms for relatively Lipschitz continuous convex optimization problems
| 2023-12-08 | Paper |
About some works of Boris Polyak on convergence of gradient methods and their development
| 2023-11-28 | Paper |
Gradient-Type Methods for Optimization Problems with Polyak-Łojasiewicz Condition: Early Stopping and Adaptivity to Inexactness Parameter
Communications in Computer and Information Science | 2023-11-17 | Paper |
Solving strongly convex-concave composite saddle-point problems with low dimension of one group of variable
Sbornik: Mathematics | 2023-10-04 | Paper |
Intermediate Gradient Methods with Relative Inexactness
| 2023-09-30 | Paper |
Stopping rules for gradient methods for non-convex problems with additive noise in gradient
Journal of Optimization Theory and Applications | 2023-09-19 | Paper |
Some adaptive first-order methods for variational inequalities with relatively strongly monotone operators and generalized smoothness
Optimization and Applications | 2023-08-10 | Paper |
Adaptive Methods or Variational Inequalities with Relatively Smooth and Reletively Strongly Monotone Operators
| 2023-08-01 | Paper |
Adaptive Variant of the Frank-Wolfe Algorithm for Convex Optimization Problems
| 2023-07-29 | Paper |
Gradient-Type Method for Optimization Problems with Polyak-Lojasiewicz Condition: Relative Inexactness in Gradient and Adaptive Parameters Setting
| 2023-07-26 | Paper |
Stopping Rules for Gradient Method for Saddle Point Problems with Twoside Polyak-Lojasievich Condition
| 2023-07-19 | Paper |
Highly Smoothness Zero-Order Methods for Solving Optimization Problems under PL Condition
| 2023-05-25 | Paper |
Online Optimization Problems with Functional Constraints under Relative Lipschitz Continuity and Relative Strong Convexity Conditions
| 2023-03-05 | Paper |
Numerical methods for some classes of variational inequalities with relatively strongly monotone operators
Mathematical Notes | 2023-01-04 | Paper |
Subgradient methods for non-smooth optimization problems with some relaxation of sharp minimum
| 2022-12-12 | Paper |
Sequential subspace optimization for quasar-convex optimization problems with inexact gradient
Communications in Computer and Information Science | 2022-11-29 | Paper |
An adaptive analog of Nesterov's method for variational inequalities with a strongly monotone operator
Сибирский журнал вычислительной математики | 2022-10-26 | Paper |
Gradient-Type Methods For Decentralized Optimization Problems With Polyak-{\L}ojasiewicz Condition Over Time-Varying Networks
| 2022-10-07 | Paper |
Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle
Journal of Optimization Theory and Applications | 2022-08-01 | Paper |
Inexact model: a framework for optimization and variational inequalities
Optimization Methods \& Software | 2022-06-13 | Paper |
Adaptation to Inexactness for some Gradient-type Methods
| 2021-10-11 | Paper |
New version of mirror prox for variational inequalities with adaptation to inexactness
| 2021-09-14 | Paper |
Some Methods for Relatively Strongly Monotone Variational Inequalities
| 2021-09-07 | Paper |
Sequential Subspace Optimization for Quasar-Convex Optimization Problems with Inexact Gradient
| 2021-08-13 | Paper |
Convex optimization
| 2021-06-03 | Paper |
Mirror descent and constrained online optimization problems
| 2021-05-18 | Paper |
Adaptive Gradient-type Methods for Convex Optimization Problems with Relative Accuracy and Sharp Minimum
| 2021-03-31 | Paper |
Algorithms for solving variational inequalities and saddle point problems with some generalizations of Lipschitz property for operators
| 2021-03-01 | Paper |
Analogues of switching subgradient schemes for relatively Lipschitz-continuous convex programming problems
Mathematical Optimization Theory and Operations Research | 2021-02-25 | Paper |
Adaptive Mirror Descent Methods for Convex Programming Problems with delta-subgradients
| 2020-12-23 | Paper |
Accelerated methods for saddle-point problem
Computational Mathematics and Mathematical Physics | 2020-12-10 | Paper |
Some analogue of quadratic interpolation for a special class of non-smooth functionals and one application to adaptive mirror descent
| 2020-11-12 | Paper |
Solving strongly convex-concave composite saddle point problems with a small dimension of one of the variables
| 2020-10-05 | Paper |
Hahn-Banach type theorems on functional separation for convex ordered normed cones
Eurasian Mathematical Journal | 2020-08-26 | Paper |
An analogue of the Hahn-Banach theorem for functionals on abstract convex cones
Matematicheskie Zametki | 2020-08-24 | Paper |
Applications of anticompact sets to analogs of Denjoy-Young-Saks and Lebesgue theorems
Matematicheskie Zametki | 2020-08-24 | Paper |
Gradient methods for problems with inexact model of the objective
| 2020-05-19 | Paper |
On some methods for strongly convex optimization problems with one functional constraint
| 2020-05-19 | Paper |
Inexact Relative Smoothness and Strong Convexity for Optimization and Variational Inequalities by Inexact Model
| 2020-01-23 | Paper |
Adaptive mirror descent algorithms for convex and strongly convex optimization problems with functional constraints
Journal of Applied and Industrial Mathematics | 2019-12-02 | Paper |
Adaptive Gradient Methods for Some Classes of Non-Smooth Optimization Problems
| 2019-11-19 | Paper |
Adaptive Mirror Descent for the Network Utility Maximization Problem
| 2019-11-17 | Paper |
An adaptive proximal method for variational inequalities
Computational Mathematics and Mathematical Physics | 2019-11-04 | Paper |
Mirror Descent for Constrained Optimization Problems with Large Subgradient Values
| 2019-08-01 | Paper |
Accelerated methods for composite non-bilinear saddle point problem
| 2019-06-09 | Paper |
Mirror descent and convex optimization problems with non-smooth inequality constraints
| 2019-05-21 | Paper |
Advances in Low-Memory Subgradient Optimization
| 2019-02-05 | Paper |
Some adaptive proximal method for a special class of variational inequalities and related problems
| 2019-01-09 | Paper |
One Method for Minimization a Convex Lipschitz-Continuous Function of 2 Variables on a Fixed Square
| 2018-12-26 | Paper |
On Some Adaptive Mirror Descent Algorithms for Convex and Strongly Convex Optimization Problems with Functional Constraints
| 2018-12-18 | Paper |
A sublinear analog of the Banach-Mazur theorem in separated convex cones with norm
Mathematical Notes | 2018-10-30 | Paper |
On sublinear analogs of weak topologies in normed cones
Mathematical Notes | 2018-08-31 | Paper |
Generalized Mirror Prox for Monotone Variational Inequalities: Universality and Inexact Oracle
| 2018-06-13 | Paper |
Theorems on functional separability in a special class of normed cones
| 2018-06-05 | Paper |
Adaptive algorithms for mirror descent in convex programming problems with Lipschitz constraints
| 2018-05-27 | Paper |
Some adaptive analog of Yu. E. Nesterov's method for variational inequalities with a strongly monotone operator
| 2018-03-11 | Paper |
One Mirror Descent Algorithm for Convex Constrained Optimization Problems with non-standard growth properties
| 2018-03-04 | Paper |
The Bochner integral in linear normed cones
| 2018-01-09 | Paper |
Sequential analogues of the Lyapunov and Krein-Milman theorems in Fréchet spaces
Journal of Mathematical Sciences (New York) | 2017-12-06 | Paper |
Fixed point theorem analogs for mappings with special properties of continuity
| 2017-05-18 | Paper |
Anti-compacts and their applications to analogs of Lyapunov and Lebesgue theorems in Fréchet spaces
Journal of Mathematical Sciences (New York) | 2016-11-16 | Paper |
Analogs of the Schauder theorem that use anticompacta
Mathematical Notes | 2016-10-18 | Paper |
An analogue of Uhl's theorem on the convexity of the image of vector measures
Dinamicheskie Sistemy (Simferopol') | 2016-10-13 | Paper |
Analogs of the Krein-Milman theorem for bounded convex sets in infinite-dimensional spaces
Dinamicheskie Sistemy (Simferopol') | 2016-03-16 | Paper |
The limit form of the Radon-Nikodým property is true for all Fréchet spaces
Journal of Mathematical Sciences (New York) | 2015-02-20 | Paper |
Compact subdifferentials: the formula of finite increments and related topics
Journal of Mathematical Sciences (New York) | 2014-10-13 | Paper |
Analog of Denjoy-Young-Saks theorem about contingency for mappings into Fréchet spaces and one its application in theory of vector integration
Trudy Instituta Prikladnoĭ Matematiki i Mekhaniki | 2012-07-31 | Paper |
Strong compact properties of the mappings and K-Radon-Nikodym property
| 2011-02-22 | Paper |
scientific article; zbMATH DE number 5855701 (Why is no real title available?)
| 2011-02-22 | Paper |
scientific article; zbMATH DE number 5697643 (Why is no real title available?)
| 2010-04-22 | Paper |
scientific article; zbMATH DE number 5697335 (Why is no real title available?)
| 2010-04-22 | Paper |
Compact variation, compact subdifferentiability and indefinite Bochner integral
| 2009-08-08 | Paper |
The compact subdifferential of real-valued functions
| 2009-02-28 | Paper |
Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
| N/A | Paper |
