| Discrete Choice Prox-Functions on the Simplex | 0 | 0.34 | 2022 |
| Local convergence of tensor methods | 0 | 0.34 | 2022 |
| Rates of superlinear convergence for classical quasi-Newton methods | 0 | 0.34 | 2022 |
| Superfast Second-Order Methods For Unconstrained Convex Optimization | 0 | 0.34 | 2021 |
| On Inexact Solution Of Auxiliary Problems In Tensor Methods For Convex Optimization | 0 | 0.34 | 2021 |
| New Results On Superlinear Convergence Of Classical Quasi-Newton Methods | 0 | 0.34 | 2021 |
| Primal-dual accelerated gradient methods with small-dimensional relaxation oracle. | 1 | 0.38 | 2021 |
| Minimizing Uniformly Convex Functions By Cubic Regularization Of Newton Method | 1 | 0.37 | 2021 |
| Implementable Tensor Methods In Unconstrained Convex Optimization | 1 | 0.35 | 2021 |
| INEXACT HIGH-ORDER PROXIMAL-POINT METHODS WITH AUXILIARY SEARCH PROCEDURE | 0 | 0.34 | 2021 |
| Greedy Quasi-Newton Methods With Explicit Superlinear Convergence | 0 | 0.34 | 2021 |
| On the Quality of First-Order Approximation of Functions with Hölder Continuous Gradient. | 0 | 0.34 | 2020 |
| Soft clustering by convex electoral model. | 0 | 0.34 | 2020 |
| Stochastic Subspace Cubic Newton Method | 0 | 0.34 | 2020 |
| Contracting Proximal Methods For Smooth Convex Optimization | 0 | 0.34 | 2020 |
| Tensor Methods For Minimizing Convex Functions With Holder Continuous Higher-Order Derivatives | 1 | 0.35 | 2020 |
| Convex optimization based on global lower second-order models | 0 | 0.34 | 2020 |
| Smoothness parameter of power of Euclidean norm | 0 | 0.34 | 2020 |
| Inexact Tensor Methods with Dynamic Accuracies | 0 | 0.34 | 2020 |
| Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions. | 1 | 0.37 | 2019 |
| Relatively Smooth Convex Optimization by First-Order Methods, and Applications. | 9 | 0.52 | 2018 |
| Increasing Training Stability For Deep Cnns | 0 | 0.34 | 2018 |
| Dual subgradient method with averaging for optimal resource allocation. | 2 | 0.38 | 2018 |
| Complexity Bounds for Primal-dual Methods Minimizing the Model of Objective Function | 9 | 0.54 | 2018 |
| Random block coordinate descent methods for linearly constrained optimization over networks | 5 | 0.45 | 2017 |
| Random gradient-free minimization of convex functions | 95 | 3.57 | 2017 |
| Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems. | 15 | 0.62 | 2017 |
| Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians. | 6 | 0.47 | 2017 |
| Distributed Price Adjustment Based on Convex Analysis. | 1 | 0.37 | 2017 |
| Preface to the Special Issue "Optimization, Control and Applications" in Honor of Boris T. Polyak's 80th Birthday. | 0 | 0.34 | 2017 |
| A Subgradient Method for Free Material Design. | 0 | 0.34 | 2016 |
| Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods. | 0 | 0.34 | 2016 |
| Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems. | 2 | 0.36 | 2016 |
| Primal-Dual Methods for Solving Infinite-Dimensional Games | 2 | 0.38 | 2015 |
| Quasi-monotone Subgradient Methods for Nonsmooth Convex Minimization | 3 | 0.47 | 2015 |
| Brief Announcement: Computation of Fisher-Gale Equilibrium by Auction. | 0 | 0.34 | 2015 |
| Finding the stationary states of Markov chains by iterative methods. | 1 | 0.38 | 2015 |
| First-order methods of smooth convex optimization with inexact oracle | 36 | 1.62 | 2014 |
| Subgradient methods for huge-scale optimization problems | 13 | 0.79 | 2014 |
| Gradient methods for minimizing composite functions. | 145 | 5.30 | 2013 |
| On first-order algorithms for l 1 /nuclear norm minimization | 3 | 0.45 | 2013 |
| Hessian distances and their applications in the complexity analysis of interior-point methods | 0 | 0.34 | 2013 |
| Nearest stable system using successive convex approximations | 5 | 0.69 | 2013 |
| Optimizing the Spectral Radius. | 4 | 0.75 | 2013 |
| Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes | 3 | 0.40 | 2012 |
| Design and Operations of Gas Transmission Networks | 10 | 1.15 | 2012 |
| Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization. | 23 | 1.43 | 2012 |
| Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems. | 355 | 16.40 | 2012 |
| Towards non-symmetric conic optimization | 5 | 0.48 | 2012 |
| Narrow Scope For Resolution-Limit-Free Community Detection | 4 | 0.44 | 2011 |
