1.
Gradient methods for minimizing composite functions
by Nesterov, Yu
Mathematical programming, 2012, Vol.140 (1), p.125-161
2.
Universal gradient methods for convex optimization problems
by Nesterov, Yu
Mathematical programming, 2014, Vol.152 (1-2), p.381-404
3.
Complexity bounds for primal-dual methods minimizing the model of objective function
by Nesterov, Yu
Mathematical programming, 2017, Vol.171 (1-2), p.311-330
4.
Subgradient methods for huge-scale optimization problems
by Nesterov, Yu
Mathematical programming, 2013, Vol.146 (1-2), p.275-297
5.
Smooth minimization of non-smooth functions
by NESTEROV, Yu
Mathematical programming, 2005, Vol.103 (1), p.127-152
6.
Accelerating the cubic regularization of Newton’s method on convex problems
by Nesterov, Yu
Mathematical programming, 2007, Vol.112 (1), p.159-181
7.
Linear convergence of first order methods for non-strongly convex optimization
by Necoara, I
Mathematical programming, 2018, Vol.175 (1-2), p.69-107
8.
Lexicographic differentiation of nonsmooth functions
by NESTEROV, Yu
Mathematical programming, 2005, Vol.104 (2-3), p.669-700
9.
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
by Nesterov, Yu. E
Mathematics of operations research, 1997, Vol.22 (1), p.1-42
10.
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods
by Nesterov
Foundations of computational mathematics, 2002, Vol.2 (4), p.333
11.
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity
by NESTEROV, Yu
Mathematical programming, 2004, Vol.99 (1), p.149-174
12.
An interior-point method for generalized linear-fractional programming
by Nesterov, Yu. E.
Mathematical programming, 1995, Vol.69 (1-3), p.177-204
13.
Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods
by Nesterov, Yu
Mathematics of operations research, 1998, Vol.23 (1), p.1-38
14.
Complexity estimates of some cutting plane methods based on the analytic barrier
by Nesterov, Yu
Mathematical programming, 1995, Vol.69 (1-3), p.149-176
15.
Long-step strategies in interior-point primal-dual methods
by NESTEROV, YU
Mathematical programming, 1997, Vol.76 (1), p.47-94
16.
Interior-point methods : An old and new approach to nonlinear programming
by NESTEROV, YU
Mathematical programming, 1997, Vol.79 (1-3), p.285-297
17.
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
by NESTEROV, Yu
Mathematical programming, 1999, Vol.84 (2), p.227-267
18.
Positivity and Linear Matrix Inequalities
by Genin, Y
European journal of control, 2002, Vol.8 (3), p.275-298
19.
Positivity and linear matrix inequalities: Dissipativity of dynamical systems: application in control
by GENIN, Y
European journal of control, 2002, Vol.8 (3), p.275-298
20.
Complexity estimates of some cutting plane methods based on the analytic barrier: Nondifferentiable and large-scale optimization
by NESTEROV, YU
Mathematical programming, 1995, Vol.69 (1), p.149-176
