| Publication | Date of Publication | Type |
|---|
Optimization in complex spaces with the mixed Newton method
Journal of Global Optimization | 2024-10-14 | Paper |
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 |
Adaptive algorithms for relatively Lipschitz continuous convex optimization problems
(available as arXiv preprint) | 2023-12-08 | 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 |
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 |
| 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 |
| 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 |
| Optimization in complex spaces with the Mixed Newton Method | 2022-07-09 | Paper |
Inexact model: a framework for optimization and variational inequalities
Optimization Methods & Software | 2022-06-13 | Paper |
| An Approach for Non-Convex Uniformly Concave Structured Saddle Point Problem | 2022-02-13 | Paper |
Solving convex min-min problems with smoothness and strong convexity in one group of variables and low dimension in the other
Automation and Remote Control | 2022-01-21 | Paper |
On modification of an adaptive stochastic mirror descent algorithm for convex optimization problems with functional constraints
Forum for Interdisciplinary Mathematics | 2021-11-22 | Paper |
New version of mirror prox for variational inequalities with adaptation to inexactness
(available as arXiv preprint) | 2021-09-14 | Paper |
| Some Methods for Relatively Strongly Monotone Variational Inequalities | 2021-09-07 | Paper |
Mirror descent and constrained online optimization problems
(available as arXiv preprint) | 2021-05-18 | Paper |
| Algorithms for solving variational inequalities and saddle point problems with some generalizations of Lipschitz property for operators | 2021-03-01 | Paper |
| Solving smooth min-min and min-max problems by mixed oracle algorithms | 2021-02-28 | Paper |
Analogues of switching subgradient schemes for relatively Lipschitz-continuous convex programming problems
Mathematical Optimization Theory and Operations Research | 2021-02-25 | Paper |
Accelerated methods for saddle-point problem
Computational Mathematics and Mathematical Physics | 2020-12-10 | Paper |
| Solving strongly convex-concave composite saddle point problems with a small dimension of one of the variables | 2020-10-05 | 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 |
| Accelerated methods for composite non-bilinear saddle point problem | 2019-06-09 | Paper |
| On Some Adaptive Mirror Descent Algorithms for Convex and Strongly Convex Optimization Problems with Functional Constraints | 2018-12-18 | Paper |
| Generalized Mirror Prox for Monotone Variational Inequalities: Universality and Inexact Oracle | 2018-06-13 | Paper |
| Adaptive algorithms for mirror descent in convex programming problems with Lipschitz constraints | 2018-05-27 | Paper |
Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
(available as arXiv preprint) | N/A | Paper |
