Yu. E. Nesterov

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Primal-dual accelerated gradient descent with line search for convex and nonconvex optimization problems	2019	Sergey Guminov Yu. E. Nesterov Pavel Dvurechensky Alexander Gasnikov
+	Universal Method for Stochastic Composite Optimization Problems	2018	Alexander Gasnikov Yu. E. Nesterov
+	Efficient numerical methods for entropy-linear programming problems	2016	А. В. Гасников E. B. Gasnikova Yu. E. Nesterov Alexey Chernov
+ PDF Chat	On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods	2002	Yu. E. Nesterov Mike Todd
+ PDF Chat	Primal-Dual Interior-Point Methods for Self-Scaled Cones	1998	Yu. E. Nesterov Michael J. Todd
+ PDF Chat	Self-Scaled Barriers and Interior-Point Methods for Convex Programming	1997	Yu. E. Nesterov Michael J. Todd
+	An interior-point method for generalized linear-fractional programming	1995	Yu. E. Nesterov Arkadi Nemirovski
+	Polynomial-time dual algorithms in linear programming	1989	Yu. E. Nesterov
+	Optimal methods of smooth convex minimization	1985	Arkadi Nemirovski Yu. E. Nesterov
+	One class of methods of unconditional minimization of a convex function, having a high rate of convergence	1984	Yu. E. Nesterov
+	On a one-dimensional search procedure in methods of unconstrained minimization of a function of several variables	1982	Yu. E. Nesterov

Common Coauthors

Coauthor	Papers Together
Michael J. Todd	2
Arkadi Nemirovski	2
Alexander Gasnikov	2
E. B. Gasnikova	1
А. В. Гасников	1
Alexey Chernov	1
Sergey Guminov	1
Mike Todd	1
Pavel Dvurechensky	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Interior-Point Polynomial Algorithms in Convex Programming	1994	Yurii Nesterov Arkadi Nemirovski	3
+	Barrier Functions in Interior Point Methods	1996	Osman Güler	3
+ PDF Chat	Smooth minimization of non-smooth functions	2004	Yu. Nesterov	2
+	Long-step strategies in interior-point primal-dual methods	1997	Yu. Nesterov	2
+	An extension of Karmarkar's algorithm for linear programming using dual variables	1986	Michael J. Todd Bruce P. Burrell	2
+	Introduction to Convex Optimization	2010	Chee Wei Tan	2
+ PDF Chat	Universal gradient methods for convex optimization problems	2014	Yu. Nesterov	2
+ PDF Chat	PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS	1989	Shinji Mizuno Akiko Yoshise Takeshi Kikuchi	1
+	Markov models of macrosystems	2014	Alexander Gasnikov	1
+	On Adjusting Parameters in Homotopy Methods for Linear Programming	1996	Michael J. Todd	1
+	Unified approach to quadratically convergent algorithms for function minimization	1970	H. Y. Huang	1
+ PDF Chat	On the Nesterov--Todd Direction in Semidefinite Programming	1998	Michael J. Todd Kim-Chuan Toh Reha Tütüncü	1
+	A polynomial-time algorithm, based on Newton's method, for linear programming	1988	James Renegar	1
+	Dual multiplicative algorithms for an entropy-linear programming problem	2009	Evgenia Gasnikova	1
+	An interior-point method for fractional programs with convex constraints	1994	Roland W. Freund Florian Jarre	1
+ PDF Chat	Function minimization by conjugate gradients	1964	R. Fletcher	1
+	A polynomial method of approximate centers for linear programming	1992	C. Roos Jean-Philippe Vial	1
+ PDF Chat	On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming	1993	Shinji Mizuno Michael J. Todd Yinyu Ye	1
+	Entropy in the sense of Boltzmann and Poincaré	2014	V. V. Vedenyapin S. Z. Adzhiev	1
+	A geometric method in nonlinear programming	1980	Kosuke Tanabe	1
+	Gradient methods for minimizing composite functions	2012	Yu. Nesterov	1
+	A polynomial-time algorithm for a class of linear complementarity problems	1989	Masakazu Kojima Shinji Mizuno Akiko Yoshise	1
+	On entropy-type functionals arising in stochastic chemical kinetics related to the concentration of the invariant measure and playing the role of Lyapunov functions in the dynamics of quasiaverages	2013	Alexander Gasnikov Evgenia Gasnikova	1
+	An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems	1991	Masakazu Kojima Shinji Mizuno Akiko Yoshise	1
+	On the scaling of multidimensional matrices	1989	Joel Franklin Jens Lorenz	1
+ PDF Chat	The Geometry of Algorithms with Orthogonality Constraints	1998	Alan Edelman T. A. Arias Steven T. Smith	1
+ PDF Chat	On lower complexity bounds for large-scale smooth convex optimization	2014	Cristóbal Guzmán Arkadi Nemirovski	1
+	A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm	1986	Kurt M. Anstreicher	1
+ PDF Chat	A Centered Projective Algorithm for Linear Programming	1990	Michael J. Todd Yinyu Ye	1
+	Polynomial affine algorithms for linear programming	1990	Clóvis C. Gonzaga	1
+	Interior path following primal-dual algorithms. part I: Linear programming	1989	Renato D. C. Monteiro Ilan Adler	1
+	Differential Geometry and Symmetric Spaces	2001	Sigurđur Helgason	1
+	Method of centers for minimizing generalized eigenvalues	1993	Stephen Boyd Laurent El Ghaoui	1
+	An efficient method for finding the minimum of a function of several variables without calculating derivatives	1964	M. J. D. Powell	1
+ PDF Chat	Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems	1999	Yurii Nesterov Mike Todd Y. Ye	1
+ PDF Chat	Self-Scaled Barriers and Interior-Point Methods for Convex Programming	1997	Yu. E. Nesterov Michael J. Todd	1
+	On the Von Neumann Economic Growth Problem	1995	Yinyu Ye	1
+	First-order methods of smooth convex optimization with inexact oracle	2013	Olivier Devolder François Glineur Yurii Nesterov	1
+	Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization	1998	Levent Tunçel	1
+ PDF Chat	Adaptive Restart for Accelerated Gradient Schemes	2013	Brendan O’Donoghue Emmanuel J. Candès	1
+	First-order methods with inexact oracle: the strongly convex case	2013	Olivier Devolder François Glineur Yurii Nesterov	1
+	Interior methods for constrained optimization	1992	Margaret H. Wright	1
+	Intermediate gradient methods for smooth convex problems with inexact oracle	2013	Olivier Devolder François Glineur Yurii Nesterov	1
+	Primal-dual subgradient methods for convex problems	2007	Yurii Nesterov	1
+	On the relation between quadratic termination and convergence properties of minimization algorithms	1977	Peter Baptist Josef Stoer	1
+ PDF Chat	Non-asymptotic confidence bounds for the optimal value of a stochastic program	2017	Vincent Guigues Anatoli Juditsky Arkadi Nemirovski	1
+	Efficient numerical methods for entropy-linear programming problems	2016	А. В. Гасников E. B. Gasnikova Yu. E. Nesterov Alexey Chernov	1
+	Stochastic intermediate gradient method for convex optimization problems	2016	Alexander Gasnikov Pavel Dvurechensky	1
+	Evolutionary interpretations of entropy model for correspondence matrix calculation	2015	Alexander Gasnikov Evgenia Gasnikova Mikhail Aleksandrovich Mendel Ksenya Chepurchenko	1
+	Saddle point mirror descent algorithm for the robust PageRank problem	2016	Alexander Nazin Andrey Tremba	1