Yu. Nesterov

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Convergence of Descent Methods under Kurdyka-\L ojasiewicz Properties	2024	G. C. Bento Boris S. Mordukhovich T. S. Mota Yu. Nesterov
+ PDF Chat	Adaptive Third-Order Methods for Composite Convex Optimization	2023	Geovani Nunes Grapiglia Yu. Nesterov
+ PDF Chat	On inexact solution of auxiliary problems in tensor methods for convex optimization	2020	Geovani Nunes Grapiglia Yu. Nesterov
+ PDF Chat	Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives	2020	Geovani Nunes Grapiglia Yu. Nesterov
+ PDF Chat	Linear convergence of first order methods for non-strongly convex optimization	2018	Ion Necoara Yu. Nesterov François Glineur
+	Complexity bounds for primal-dual methods minimizing the model of objective function	2017	Yu. Nesterov
+	Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians	2017	Geovani Nunes Grapiglia Yu. Nesterov
+	Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems	2016	Yu. Nesterov Levent Tunçel
+	Linear convergence of first order methods for non-strongly convex optimization	2015	Ion Necoara Yu. Nesterov François Glineur
+	Random block coordinate descent methods for linearly constrained optimization over networks	2015	Ion Necoara Yu. Nesterov François Glineur
+	Quasi-monotone Subgradient Methods for Nonsmooth Convex Minimization	2014	Yu. Nesterov Vladimir Shikhman
+ PDF Chat	Universal gradient methods for convex optimization problems	2014	Yu. Nesterov
+	Primal-Dual Subgradient Method for Huge-Scale Linear Conic Problems	2014	Yurii Nesterov S. Shpirko
+	Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolic Cone Optimization Problems	2014	Yu. Nesterov Levent Tunçel
+	Gradient methods for minimizing composite functions	2012	Yu. Nesterov
+	Subgradient methods for huge-scale optimization problems	2012	Yu. Nesterov
+ PDF Chat	Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems	2012	Yu. Nesterov
+	Barrier subgradient method	2008	Yu. Nesterov
+	Confidence level solutions for stochastic programming	2008	Yu. Nesterov Jean-Philippe Vial
+	Primal-dual Interior-Point Methods with Asymmetric Barriers	2008	Yu. Nesterov
+	Rounding of convex sets and efficient gradient methods for linear programming problems	2007	Yu. Nesterov
+	Gradient methods for minimizing composite objective function	2007	Yu. Nesterov
+	Parabolic target space and primal–dual interior-point methods	2007	Yu. Nesterov
+	Accelerating the cubic regularization of Newton’s method on convex problems	2007	Yu. Nesterov
+	Modified Gauss–Newton scheme with worst case guarantees for global performance	2006	Yu. Nesterov
+	Cubic regularization of Newton’s method for convex problems with constraints	2006	Yu. Nesterov
+	Nonsymmetric potential-reduction methods for general cones	2006	Yu. Nesterov
+	Constructing self-concordant barriers for convex cones	2006	Yu. Nesterov
+	Towards nonsymmetric conic optimization	2006	Yu. Nesterov
+	Cubic regularization of Newton’s method for convex problems with constraints	2006	Yu. Nesterov
+	Minimizing functions with bounded variation of subgradients	2005	Yu. Nesterov
+	Accelerating the cubic regularization of Newton’s method on convex problems	2005	Yu. Nesterov
+	Primal-dual subgradient methods for convex problems	2005	Yu. Nesterov
+	Lexicographic differentiation of nonsmooth functions	2005	Yu. Nesterov
+	Lexicographic differentiation of nonsmooth functions	2005	Yu. Nesterov
+	On the accuracy of the ellipsoid norm approximation of the joint spectral radius	2005	Vincent D. Blondel Yu. Nesterov Jacques Theys
+	Primal-dual subgradient methods for convex problems	2005	Yu. Nesterov
+	Accelerating the cubic regularization of Newton’s method on convex problems	2005	Yu. Nesterov
+	Smooth minimization of non-smooth functions	2005	Yu. Nesterov
+ PDF Chat	Smooth minimization of non-smooth functions	2004	Yu. Nesterov
+	Fast Fourier Transform and its applications to integer knapsack problems	2004	Yu. Nesterov
+	Rounding of convex sets and efficient gradient methods for linear programming problems	2004	Yu. Nesterov
+ PDF Chat	Augmented self-concordant barriers and nonlinear optimization problems with finite complexity	2004	Yu. Nesterov Jean-Philippe Vial
+	methods for linear programming problems	2004	Yu. Nesterov
+	Computationally efficient approximations of the joint spectral radius	2004	Vincent D. Blondel Yu. Nesterov
+	Smoothing technique and its applications in Semidefinite Optimization	2004	Yu. Nesterov
+	Fast Fourier Transform and its applications to integer knapsack problems	2004	Yu. Nesterov
+	Unconstrained convex minimization in relative scale	2003	Yu. Nesterov
+	Fast and precise approximations of the joint spectral radius	2003	Vincent D. Blondel Yu. Nesterov
+	Modified Gauss-Newton scheme with worst-case guarantees for its global performance	2003	Yu. Nesterov
+	Random walk in a simplex and quadratic optimization over convex polytopes	2003	Yu. Nesterov
+	Smooth minimization of non-smooth functions	2003	Yu. Nesterov
+	Optimization Problems over Positive Pseudopolynomial Matrices	2003	Y. Genin Yvan Hachez Yu. Nesterov Paul Van Dooren
+	Optimizat problems over positive pseudopolynomial matrices	2003	Y. Genin Yvan Hachez Yu. Nesterov Paul Van Dooren
+	Unconstrained convex minimization in relative scale	2003	Yu. Nesterov
+	On the Riemannian geometry defined by self-concordant barriers and interior-point methods	2002	Yu. Nesterov Mike Todd
+	Stable Dynamics in Transportation Systems	2000	Yu. Nesterov André de Palma
+	Squared functional systems and optimization problems	2000	Yu. Nesterov
+	Squared functional systems and optimization problems	2000	Yu. Nesterov
+	Homogeneous analytic center cutting plane methods with approximate centers	1999	Yu. Nesterov Olivier Péton Jean-Philippe Vial
+	Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods	1998	Yu. Nesterov Arkadi Nemirovski
+	Semidefinite relaxation and nonconvex quadratic optimization	1998	Yu. Nesterov
+	Semidefinite relaxation and nonconvex quadratic optimization	1998	Yu. Nesterov
+	Semidefinite relaxation and nonconvex quadratic optimization	1998	Yu. Nesterov
+	Interior-point methods: An old and new approach to nonlinear programming	1997	Yu. Nesterov
+	Long-step strategies in interior-point primal-dual methods	1997	Yu. Nesterov
+	Advances in nonlinear convex op	1997	Yu. Nesterov
+	Complexity estimates of some cutting plane methods based on the analytic barrier	1995	Yu. Nesterov
+	Conic formulation of a convex programming problem and duality	1992	Yu. Nesterov Arkadi Nemirovsky

Common Coauthors

Coauthor	Papers Together
Geovani Nunes Grapiglia	4
François Glineur	3
Jean-Philippe Vial	3
Vincent D. Blondel	3
Ion Necoara	3
Y. Genin	2
Yvan Hachez	2
Paul Van Dooren	2
Levent Tunçel	2
Arkadi Nemirovsky	1
S. Shpirko	1
G. C. Bento	1
Mike Todd	1
Arkadi Nemirovski	1
Jacques Theys	1
Vladimir Shikhman	1
Boris S. Mordukhovich	1
Olivier Péton	1
T. S. Mota	1
André de Palma	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Interior-Point Polynomial Algorithms in Convex Programming	1994	Yurii Nesterov Arkadi Nemirovski	17
+	Introductory Lectures on Convex Optimization: A Basic Course	2014	Ю Е Нестеров	16
+ PDF Chat	Smooth minimization of non-smooth functions	2004	Yu. Nesterov	12
+	Cubic regularization of Newton method and its global performance	2006	Yurii Nesterov B. T. Polyak	9
+	Iterative Solution of Nonlinear Equations in Several Variables	2000	J. M. Ortega Werner C. Rheinboldt	8
+	A Mathematical View of Interior-Point Methods in Convex Optimization	2001	James Renegar	8
+	Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice	2002	Daniel Bienstock	6
+ PDF Chat	Primal-Dual Interior-Point Methods for Self-Scaled Cones	1998	Yu. E. Nesterov Michael J. Todd	6
+	Long-step strategies in interior-point primal-dual methods	1997	Yu. Nesterov	6
+	Numerical Methods for Unconstrained Optimization and Nonlinear Equations	1996	J. E. Dennis Robert B. Schnabel	5
+	Accelerating the cubic regularization of Newton’s method on convex problems	2007	Yu. Nesterov	5
+ PDF Chat	Self-Scaled Barriers and Interior-Point Methods for Convex Programming	1997	Yu. E. Nesterov Michael J. Todd	5
+	A polynomial-time algorithm, based on Newton's method, for linear programming	1988	James Renegar	4
+	Trust Region Methods	2000	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint	4
+ PDF Chat	On the Nesterov--Todd Direction in Semidefinite Programming	1998	Michael J. Todd Kim-Chuan Toh Reha Tütüncü	3
+	Nonlinear Programming: Sequential Unconstrained Minimization Techniques	1968	Anthony V. Fiacco Garth P. McCormick	3
+	Decomposition and Nondifferentiable Optimization with the Projective Algorithm	1992	Jean‐Louis Goffin Alain Haurie J.‐P. Vial	3
+ PDF Chat	Towards Nonsymmetric Conic Optimization	2006	Yurii Nesterov	3
+	Complexity estimates of some cutting plane methods based on the analytic barrier	1995	Yu. Nesterov	3
+	Iterative Solution of Nonlinear Equations in Several Variables	1971	E. I. J. M. Ortega Werner C. Rheinboldt	3
+	Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions	2019	Geovani Nunes Grapiglia Yurii Nesterov	3
+	Generalization of Primal—Dual Interior-Point Methods to Convex Optimization Problems in Conic Form	2001	Levent Tunçel	3
+ PDF Chat	Implementable tensor methods in unconstrained convex optimization	2019	Yurii Nesterov	3
+	Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models	2016	E. G. Birgin John Lenon Cardoso Gardenghi J. M. Martı́nez Sandra A. Santos Philippe L. Toint	3
+	Gradient methods for minimizing composite functions	2012	Yu. Nesterov	3
+	Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians	2017	Geovani Nunes Grapiglia Yu. Nesterov	3
+ PDF Chat	Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy	2019	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	3
+	Lectures on Modern Convex Optimization	2001	Aharon Ben‐Tal Arkadi Nemirovski	3
+	Mirror descent and nonlinear projected subgradient methods for convex optimization	2003	Amir Beck Marc Teboulle	3
+	On self-concordant barrier functions for conic hulls and fractional programming	1996	Roland W. Freund Florian Jarre Siegfried Schaible	3
+ PDF Chat	Randomized Methods for Linear Constraints: Convergence Rates and Conditioning	2010	D. Leventhal Adrian S. Lewis	3
+	Convex analysis and minimization algorithms	1993	Jean‐Baptiste Hiriart‐Urruty Claude Lemaréchal	3
+	Gradient methods for minimizing composite objective function	2007	Yu. Nesterov	3
+	An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations	1990	Pravin M. Vaidya	3
+ PDF Chat	New variants of bundle methods	1995	Claude Lemaréchal Arkadi Nemirovski Yurii Nesterov	3
+	Hyperbolic Polynomials and Interior Point Methods for Convex Programming	1997	Osman Güler	3
+	Primal-dual subgradient methods for convex problems	2007	Yurii Nesterov	3
+	An Efficient Algorithm for Minimizing a Sum of <i>p</i>-Norms	2000	Guoliang Xue Yinyu Ye	3
+	Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization	1995	Farid Alizadeh	3
+	Mathematical Programming	1995	Brian Conolly S. Vajda	3
+	On convergence rates of subgradient optimization methods	1977	J. L. Goffin	3
+	Error bounds for solutions of linear equations and inequalities	1995	Diethard Klatte Gisbert Thiere	2
+ PDF Chat	Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems	2004	Arkadi Nemirovski	2
+	A cutting plane algorithm for convex programming that uses analytic centers	1995	David S. Atkinson Pravin M. Vaidya	2
+	Characterizations of linear suboptimality for mathematical programs with equilibrium constraints	2007	Boris S. Mordukhovich	2
+ PDF Chat	On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming	1999	Jun Ji Florian A. Potra Rongqin Sheng	2
+ PDF Chat	Book Review: A mathematical view of interior-point methods in convex optimization	2003	Robert M. Freund	2
+ PDF Chat	A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programming	1993	Y. Ye Osman Güler R. A. Tapia Y. Zhang	2
+	The volume algorithm: producing primal solutions with a subgradient method	2000	Francisco Barahona Ranga Anbil	2
+	An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations	1989	Clóvis C. Gonzaga	2