| Publication | Date of Publication | Type |
|---|
An optimal lower bound for smooth convex functions
(available as arXiv preprint) | N/A | Paper |
Parabolic target-space interior-point algorithm for monotone weighted linear complementarity problem
Mathematical Programming. Series A. Series B | 2026-09-16 | Paper |
Improved global performance guarantees of second-order methods in convex minimization
Foundations of Computational Mathematics | 2026-09-11 | Paper |
New interior-point algorithm for linear optimization based on a universal tangent direction
SIAM Journal on Optimization | 2026-03-12 | Paper |
An optimal lower bound for smooth convex functions
Foundations of Computational Mathematics | 2025-12-19 | Paper |
Convergence of descent optimization algorithms under Polyak-Łojasiewicz-Kurdyka conditions
Journal of Optimization Theory and Applications | 2025-09-02 | Paper |
Quartic regularity
Vietnam Journal of Mathematics | 2025-07-27 | Paper |
Convex quartic problems: homogenized gradient method and preconditioning
SIAM Journal on Optimization | 2025-04-23 | Paper |
Primal subgradient methods with predefined step sizes
Journal of Optimization Theory and Applications | 2024-12-27 | Paper |
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
Mathematical Programming. Series A. Series B | 2024-11-07 | Paper |
Set-limited functions and polynomial-time interior-point methods
Journal of Optimization Theory and Applications | 2024-09-02 | Paper |
Gradient regularization of Newton method with Bregman distances
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Correction to: ``Computation of Fisher-Gale equilibrium by auction''
Journal of the Operations Research Society of China | 2024-02-09 | Paper |
Super-Universal Regularized Newton Method
SIAM Journal on Optimization | 2024-01-17 | Paper |
| High-Order Reduced-Gradient Methods for Composite Variational Inequalities | 2023-11-25 | Paper |
| Primal subgradient methods with predefined stepsizes | 2023-11-23 | Paper |
Adaptive Third-Order Methods for Composite Convex Optimization
SIAM Journal on Optimization | 2023-08-11 | Paper |
Conic optimization-based algorithms for nonnegative matrix factorization
Optimization Methods & Software | 2023-08-09 | Paper |
| Convex quartic problems: homogenized gradient method and preconditioning | 2023-06-30 | Paper |
Subgradient ellipsoid method for nonsmooth convex problems
Mathematical Programming. Series A. Series B | 2023-05-02 | Paper |
Inexact accelerated high-order proximal-point methods
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Affine-invariant contracting-point methods for convex optimization
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
| Gradient Methods for Stochastic Optimization in Relative Scale | 2023-01-19 | Paper |
Inexact basic tensor methods for some classes of convex optimization problems
Optimization Methods & Software | 2022-10-06 | Paper |
Efficient numerical methods to solve sparse linear equations with application to PageRank
Optimization Methods & Software | 2022-10-06 | Paper |
Gradient methods with memory
Optimization Methods & Software | 2022-10-06 | Paper |
Tensor methods for finding approximate stationary points of convex functions
Optimization Methods & Software | 2022-09-30 | Paper |
High-order optimization methods for fully composite problems
SIAM Journal on Optimization | 2022-09-29 | Paper |
Soft clustering by convex electoral model
Soft Computing | 2022-07-21 | Paper |
Rates of superlinear convergence for classical quasi-Newton methods
Mathematical Programming. Series A. Series B | 2022-06-29 | Paper |
Primal-dual accelerated gradient methods with small-dimensional relaxation oracle
Optimization Methods & Software | 2022-06-27 | Paper |
Discrete choice prox-functions on the simplex
Mathematics of Operations Research | 2022-05-17 | Paper |
Local convergence of tensor methods
Mathematical Programming. Series A. Series B | 2022-04-29 | Paper |
Dynamic pricing under nested logit demand
(available as arXiv preprint) | 2022-02-01 | Paper |
| Dynamic pricing under nested logit demand | 2022-02-01 | Paper |
| Quartic Regularity | 2022-01-13 | Paper |
Inexact high-order proximal-point methods with auxiliary search procedure
SIAM Journal on Optimization | 2021-12-01 | Paper |
Superfast second-order methods for unconstrained convex optimization
Journal of Optimization Theory and Applications | 2021-11-18 | Paper |
| High-order methods beyond the classical complexity bounds, II: inexact high-order proximal-point methods with segment search | 2021-09-25 | Paper |
| High-order methods beyond the classical complexity bounds, I: inexact high-order proximal-point methods | 2021-07-13 | Paper |
New results on superlinear convergence of classical quasi-Newton methods
Journal of Optimization Theory and Applications | 2021-06-15 | Paper |
Minimizing uniformly convex functions by cubic regularization of Newton method
Journal of Optimization Theory and Applications | 2021-06-15 | Paper |
Computation of the analytic center of the solution set of the linear matrix inequality arising in continuous- and discrete-time passivity analysis
Vietnam Journal of Mathematics | 2021-04-29 | Paper |
On inexact solution of auxiliary problems in tensor methods for convex optimization
Optimization Methods & Software | 2021-04-15 | Paper |
Optimization Methods for Fully Composite Problems
(available as arXiv preprint) | 2021-03-23 | Paper |
Greedy quasi-Newton methods with explicit superlinear convergence
SIAM Journal on Optimization | 2021-03-10 | Paper |
Implementable tensor methods in unconstrained convex optimization
Mathematical Programming. Series A. Series B | 2021-02-15 | Paper |
Contracting proximal methods for smooth convex optimization
SIAM Journal on Optimization | 2020-12-11 | Paper |
Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
SIAM Journal on Optimization | 2020-10-08 | Paper |
Affine-invariant contracting-point methods for Convex Optimization
(available as arXiv preprint) | 2020-09-18 | Paper |
| Convex optimization based on global lower second-order models | 2020-06-15 | Paper |
Smoothness parameter of power of Euclidean norm
Journal of Optimization Theory and Applications | 2020-05-11 | Paper |
On the quality of first-order approximation of functions with Hölder continuous gradient
Journal of Optimization Theory and Applications | 2020-04-07 | Paper |
| Inexact Tensor Methods with Dynamic Accuracies | 2020-02-21 | Paper |
Computing Closest Stable Nonnegative Matrix
SIAM Journal on Matrix Analysis and Applications | 2020-01-17 | Paper |
Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
Doklady Mathematics | 2019-07-18 | Paper |
Tensor Methods for Finding Approximate Stationary Points of Convex Functions
(available as arXiv preprint) | 2019-07-13 | Paper |
Linear convergence of first order methods for non-strongly convex optimization
Mathematical Programming. Series A. Series B | 2019-05-17 | Paper |
Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks
Computational Mathematics and Mathematical Physics | 2019-01-15 | Paper |
Accelerated regularized Newton methods for minimizing composite convex functions
SIAM Journal on Optimization | 2019-01-14 | Paper |
Computation of Fisher-Gale equilibrium by auction
Journal of the Operations Research Society of China | 2018-08-10 | Paper |
Lectures on convex optimization
Springer Optimization and Its Applications | 2018-07-23 | Paper |
Universal method for stochastic composite optimization problems
Computational Mathematics and Mathematical Physics | 2018-04-25 | Paper |
Relatively smooth convex optimization by first-order methods, and applications
SIAM Journal on Optimization | 2018-02-14 | Paper |
Random block coordinate descent methods for linearly constrained optimization over networks
Journal of Optimization Theory and Applications | 2017-09-01 | Paper |
Distributed price adjustment based on convex analysis
Journal of Optimization Theory and Applications | 2017-06-22 | Paper |
Regularized Newton methods for minimizing functions with Hölder continuous hessians
SIAM Journal on Optimization | 2017-05-30 | Paper |
Random gradient-free minimization of convex functions
Foundations of Computational Mathematics | 2017-05-23 | Paper |
Efficiency of the accelerated coordinate descent method on structured optimization problems
SIAM Journal on Optimization | 2017-01-31 | Paper |
Algorithmic principle of least revenue for finding market equilibria
Optimization and Its Applications in Control and Data Sciences | 2017-01-27 | Paper |
A subgradient method for free material design
SIAM Journal on Optimization | 2016-11-15 | Paper |
Efficient numerical methods for entropy-linear programming problems
Computational Mathematics and Mathematical Physics | 2016-10-19 | Paper |
Excessive revenue model of competitive markets
Nonlinear Analysis and Optimization | 2016-09-02 | Paper |
Finding the stationary states of Markov chains by iterative methods
Applied Mathematics and Computation | 2016-06-22 | Paper |
| Primal-dual method for searching equillibriums in mixed traffic assignment problems | 2016-04-27 | Paper |
| Universal fast gradient method for stochastic composit optimization problems | 2016-04-18 | Paper |
| Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods | 2016-03-02 | Paper |
Primal-dual methods for solving infinite-dimensional games
Journal of Optimization Theory and Applications | 2015-09-03 | Paper |
Nearest stable system using successive convex approximations
Automatica | 2015-08-27 | Paper |
On the efficiency of a randomized mirror descent algorithm in online optimization problems
Computational Mathematics and Mathematical Physics | 2015-07-13 | Paper |
| Universal method with inexact oracle and its applications for searching equillibriums in multistage transport problems | 2015-05-31 | Paper |
On the three-stage version of stable dynamic model
(available as arXiv preprint) | 2015-02-18 | Paper |
| On the three-stage version of stable dynamic model | 2015-02-18 | Paper |
Primal-dual subgradient method for huge-scale linear conic problems
SIAM Journal on Optimization | 2014-12-12 | Paper |
| Stochastic gradient methods with inexact oracle | 2014-11-16 | Paper |
| Learning Supervised PageRank with Gradient-Free Optimization Methods | 2014-11-16 | Paper |
| Entropy linear programming | 2014-10-28 | Paper |
| Efficient randomized mirror descents in stochastic online convex optimization | 2014-10-12 | Paper |
Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
Stochastic Systems | 2014-10-07 | Paper |
First-order methods of smooth convex optimization with inexact oracle
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
Subgradient methods for huge-scale optimization problems
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
Positivity and linear matrix inequalities
European Journal of Control | 2014-08-07 | Paper |
On first-order algorithms for \(\ell_{1}/\)nuclear norm minimization
Acta Numerica | 2014-06-11 | Paper |
Confidence level solutions for stochastic programming
Automatica | 2014-03-19 | Paper |
| Primal-dual subgradient methods for minimizing uniformly convex functions | 2014-01-08 | Paper |
Optimizing the spectral radius
SIAM Journal on Matrix Analysis and Applications | 2013-12-13 | Paper |
Gradient methods for minimizing composite functions
Mathematical Programming. Series A. Series B | 2013-08-12 | Paper |
Hessian distances and their applications in the complexity analysis of interior-point methods
Optimization Methods & Software | 2013-06-24 | Paper |
Towards non-symmetric conic optimization
Optimization Methods & Software | 2012-11-06 | Paper |
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
Mathematical Programming. Series A. Series B | 2012-11-02 | Paper |
Efficiency of coordinate descent methods on huge-scale optimization problems
SIAM Journal on Optimization | 2012-09-12 | Paper |
Double smoothing technique for large-scale linearly constrained convex optimization
SIAM Journal on Optimization | 2012-09-12 | Paper |
