default search action
Yurii E. Nesterov
Yurii Evgenievich Nesterov
Person information
- affiliation: Catholic University of Louvain (UCL), CORE, Louvain-la-Neuve, Belgium
- award (2009): John von Neumann Theory Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j97]Yurii E. Nesterov
:
Set-Limited Functions and Polynomial-Time Interior-Point Methods. J. Optim. Theory Appl. 202(1): 11-26 (2024) - [j96]Nikita Doikov
Gradient regularization of Newton method with Bregman distances. Math. Program. 204(1): 1-25 (2024) - [j95]Masoud Ahookhosh
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods. Math. Program. 208(1): 365-407 (2024) - [j94]Masoud Ahookhosh
Correction: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods. Math. Program. 208(1): 409-410 (2024) - [j93]Nikita Doikov
Super-Universal Regularized Newton Method. SIAM J. Optim. 34(1): 27-56 (2024) - 2023
- [j92]Yurii E. Nesterov
Inexact accelerated high-order proximal-point methods. Math. Program. 197(1): 1-26 (2023) - [j91]Nikita Doikov
Affine-invariant contracting-point methods for Convex Optimization. Math. Program. 198(1): 115-137 (2023) - [j90]Anton Rodomanov
Subgradient ellipsoid method for nonsmooth convex problems. Math. Program. 199(1): 305-341 (2023) - [j89]Valentin Leplat
Conic optimization-based algorithms for nonnegative matrix factorization. Optim. Methods Softw. 38(4): 837-859 (2023) - [j88]Geovani Nunes Grapiglia, Yurii E. Nesterov:
Adaptive Third-Order Methods for Composite Convex Optimization. SIAM J. Optim. 33(3): 1855-1883 (2023) - 2022
- [j87]David Müller, Yurii E. Nesterov
Discrete Choice Prox-Functions on the Simplex. Math. Oper. Res. 47(1): 485-507 (2022) - [j86]Nikita Doikov
Local convergence of tensor methods. Math. Program. 193(1): 315-336 (2022) - [j85]Anton Rodomanov
Rates of superlinear convergence for classical quasi-Newton methods. Math. Program. 194(1): 159-190 (2022) - [j84]Geovani Nunes Grapiglia
Tensor methods for finding approximate stationary points of convex functions. Optim. Methods Softw. 37(2): 605-638 (2022) - [j83]Yurii E. Nesterov
Inexact basic tensor methods for some classes of convex optimization problems. Optim. Methods Softw. 37(3): 878-906 (2022) - [j82]Anton Anikin
Efficient numerical methods to solve sparse linear equations with application to PageRank. Optim. Methods Softw. 37(3): 907-935 (2022) - [j81]Yurii E. Nesterov
Gradient methods with memory. Optim. Methods Softw. 37(3): 936-953 (2022) - [j80]Nikita Doikov
High-Order Optimization Methods for Fully Composite Problems. SIAM J. Optim. 32(3): 2402-2427 (2022) - [i3]Nikita Doikov, Konstantin Mishchenko, Yurii E. Nesterov:
Super-Universal Regularized Newton Method. CoRR abs/2208.05888 (2022) - 2021
- [j79]Anton Rodomanov
New Results on Superlinear Convergence of Classical Quasi-Newton Methods. J. Optim. Theory Appl. 188(3): 744-769 (2021) - [j78]Nikita Doikov
Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Method. J. Optim. Theory Appl. 189(1): 317-339 (2021) - [j77]Yurii E. Nesterov
Superfast Second-Order Methods for Unconstrained Convex Optimization. J. Optim. Theory Appl. 191(1): 1-30 (2021) - [j76]Yurii E. Nesterov
Implementable tensor methods in unconstrained convex optimization. Math. Program. 186(1): 157-183 (2021) - [j75]Geovani Nunes Grapiglia
On inexact solution of auxiliary problems in tensor methods for convex optimization. Optim. Methods Softw. 36(1): 145-170 (2021) - [j74]Yurii E. Nesterov, Alexander V. Gasnikov
Primal-dual accelerated gradient methods with small-dimensional relaxation oracle. Optim. Methods Softw. 36(4): 773-810 (2021) - [j73]Anton Rodomanov, Yurii E. Nesterov
Greedy Quasi-Newton Methods with Explicit Superlinear Convergence. SIAM J. Optim. 31(1): 785-811 (2021) - [j72]Yurii E. Nesterov
Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure. SIAM J. Optim. 31(4): 2807-2828 (2021) - 2020
- [j71]Guillaume O. Berger
On the Quality of First-Order Approximation of Functions with Hölder Continuous Gradient. J. Optim. Theory Appl. 185(1): 17-33 (2020) - [j70]Anton Rodomanov, Yurii E. Nesterov:
Smoothness Parameter of Power of Euclidean Norm. J. Optim. Theory Appl. 185(2): 303-326 (2020) - [j69]Geovani Nunes Grapiglia
Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives. SIAM J. Optim. 30(4): 2750-2779 (2020) - [j68]Nikita Doikov
Contracting Proximal Methods for Smooth Convex Optimization. SIAM J. Optim. 30(4): 3146-3169 (2020) - [j67]Yurii E. Nesterov, Vladimir Yu. Protasov
Computing Closest Stable Nonnegative Matrix. SIAM J. Matrix Anal. Appl. 41(1): 1-28 (2020) - [j66]Yurii E. Nesterov
Soft clustering by convex electoral model. Soft Comput. 24(23): 17609-17620 (2020) - [c11]Nikita Doikov, Yurii E. Nesterov:
Inexact Tensor Methods with Dynamic Accuracies. ICML 2020: 2577-2586 - [c10]Filip Hanzely, Nikita Doikov, Yurii E. Nesterov, Peter Richtárik:
Stochastic Subspace Cubic Newton Method. ICML 2020: 4027-4038 - [c9]Nikita Doikov, Yurii E. Nesterov:
Convex optimization based on global lower second-order models. NeurIPS 2020 - [i2]Filip Hanzely
Stochastic Subspace Cubic Newton Method. CoRR abs/2002.09526 (2020)
2010 – 2019
- 2019
- [j65]Ion Necoara
Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 175(1-2): 69-107 (2019) - [j64]Geovani Nunes Grapiglia
Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions. SIAM J. Optim. 29(1): 77-99 (2019) - 2018
- [j63]Yurii E. Nesterov, Vladimir Shikhman:
Dual subgradient method with averaging for optimal resource allocation. Eur. J. Oper. Res. 270(3): 907-916 (2018) - [j62]Yurii E. Nesterov
Complexity bounds for primal-dual methods minimizing the model of objective function. Math. Program. 171(1-2): 311-330 (2018) - [j61]Haihao Lu, Robert M. Freund, Yurii E. Nesterov:
Relatively Smooth Convex Optimization by First-Order Methods, and Applications. SIAM J. Optim. 28(1): 333-354 (2018) - [c8]Pierre Gillot, Jenny Benois-Pineau
Increasing Training Stability for Deep CNNS. ICIP 2018: 3423-3427 - 2017
- [j60]Yurii E. Nesterov, Vladimir G. Spokoiny
Random Gradient-Free Minimization of Convex Functions. Found. Comput. Math. 17(2): 527-566 (2017) - [j59]Boris S. Mordukhovich, Yurii E. Nesterov:
Preface to the Special Issue "Optimization, Control and Applications" in Honor of Boris T. Polyak's 80th Birthday. J. Optim. Theory Appl. 172(2): 349-350 (2017) - [j58]Yurii E. Nesterov, Vladimir Shikhman:
Distributed Price Adjustment Based on Convex Analysis. J. Optim. Theory Appl. 172(2): 594-622 (2017) - [j57]Ion Necoara
Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks. J. Optim. Theory Appl. 173(1): 227-254 (2017) - [j56]Yurii E. Nesterov, Sebastian U. Stich:
Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems. SIAM J. Optim. 27(1): 110-123 (2017) - [j55]Geovani Nunes Grapiglia
Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians. SIAM J. Optim. 27(1): 478-506 (2017) - 2016
- [j54]Yurii E. Nesterov, Levent Tunçel
Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems. SIAM J. Optim. 26(1): 139-170 (2016) - [j53]Michal Kocvara
A Subgradient Method for Free Material Design. SIAM J. Optim. 26(4): 2314-2354 (2016) - [c7]Lev Bogolubsky, Pavel E. Dvurechensky, Alexander V. Gasnikov, Gleb Gusev, Yurii E. Nesterov, Andrei M. Raigorodskii, Aleksey Tikhonov, Maksim Zhukovskii:
Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods. NIPS 2016: 4907-4915 - 2015
- [j52]Yurii E. Nesterov, Arkadi Nemirovski
Finding the stationary states of Markov chains by iterative methods. Appl. Math. Comput. 255: 58-65 (2015) - [j51]Yurii E. Nesterov, Vladimir Shikhman:
Quasi-monotone Subgradient Methods for Nonsmooth Convex Minimization. J. Optim. Theory Appl. 165(3): 917-940 (2015) - [j50]Pavel E. Dvurechensky
Primal-Dual Methods for Solving Infinite-Dimensional Games. J. Optim. Theory Appl. 166(1): 23-51 (2015) - [j49]Yurii E. Nesterov:
Universal gradient methods for convex optimization problems. Math. Program. 152(1-2): 381-404 (2015) - [c6]Yurii E. Nesterov, Vladimir Shikhman:
Brief Announcement: Computation of Fisher-Gale Equilibrium by Auction. SAGT 2015: 312-313 - 2014
- [j48]Olivier Devolder, François Glineur
First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146(1-2): 37-75 (2014) - [j47]Yurii E. Nesterov:
Subgradient methods for huge-scale optimization problems. Math. Program. 146(1-2): 275-297 (2014) - [j46]Yurii E. Nesterov, S. Shpirko:
Primal-Dual Subgradient Method for Huge-Scale Linear Conic Problems. SIAM J. Optim. 24(3): 1444-1457 (2014) - 2013
- [j45]Yurii E. Nesterov, Arkadi Nemirovski
On first-order algorithms for l1/nuclear norm minimization. Acta Numer. 22: 509-575 (2013) - [j44]Francois-Xavier Orbandexivry, Yurii E. Nesterov, Paul Van Dooren:
Nearest stable system using successive convex approximations. Autom. 49(5): 1195-1203 (2013) - [j43]Yurii E. Nesterov:
Gradient methods for minimizing composite functions. Math. Program. 140(1): 125-161 (2013) - [j42]Yurii E. Nesterov, Yu Xia:
Hessian distances and their applications in the complexity analysis of interior-point methods. Optim. Methods Softw. 28(3): 543-563 (2013) - [j41]Yurii E. Nesterov, Vladimir Protasov
Optimizing the Spectral Radius. SIAM J. Matrix Anal. Appl. 34(3): 999-1013 (2013) - 2012
- [j40]Frédéric Babonneau
Design and Operations of Gas Transmission Networks. Oper. Res. 60(1): 34-47 (2012) - [j39]Michel Baes, Alberto Del Pia
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes. Math. Program. 134(1): 305-322 (2012) - [j38]Yurii E. Nesterov:
Towards non-symmetric conic optimization. Optim. Methods Softw. 27(4-5): 893-917 (2012) - [j37]Yurii E. Nesterov:
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems. SIAM J. Optim. 22(2): 341-362 (2012) - [j36]Olivier Devolder, François Glineur
Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization. SIAM J. Optim. 22(2): 702-727 (2012) - 2011
- [j35]Yurii E. Nesterov:
Barrier subgradient method. Math. Program. 127(1): 31-56 (2011) - [c5]Vincent A. Traag
Indirect reciprocity through gossiping can lead to cooperative clusters. ALIFE 2011: 154-161 - [i1]Vincent A. Traag, Paul Van Dooren, Yurii E. Nesterov:
Narrow scope for resolution-free community detection. CoRR abs/1104.3083 (2011) - 2010
- [j34]Michel Journée, Yurii E. Nesterov, Peter Richtárik, Rodolphe Sepulchre:
Generalized Power Method for Sparse Principal Component Analysis. J. Mach. Learn. Res. 11: 517-553 (2010) - [c4]Vincent A. Traag
Exponential Ranking: Taking into Account Negative Links. SocInfo 2010: 192-202
2000 – 2009
- 2009
- [j33]Yurii E. Nesterov:
Unconstrained Convex Minimization in Relative Scale. Math. Oper. Res. 34(1): 180-193 (2009) - [j32]Boris S. Mordukhovich, Arkadi Nemirovski
Foreword: special issue on nonsmooth optimization and applications. Math. Program. 120(1): 1-2 (2009) - [j31]Yurii E. Nesterov:
Primal-dual subgradient methods for convex problems. Math. Program. 120(1): 221-259 (2009) - [j30]Vincent D. Blondel, Yurii E. Nesterov:
Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices. SIAM J. Matrix Anal. Appl. 31(3): 865-876 (2009) - 2008
- [j29]Yurii E. Nesterov, Jean-Philippe Vial:
Confidence level solutions for stochastic programming. Autom. 44(6): 1559-1568 (2008) - [j28]Yurii E. Nesterov:
Parabolic target space and primal-dual interior-point methods. Discret. Appl. Math. 156(11): 2079-2100 (2008) - [j27]Yurii E. Nesterov, Arkadi Nemirovski:
Primal Central Paths and Riemannian Distances for Convex Sets. Found. Comput. Math. 8(5): 533-560 (2008) - [j26]Yurii E. Nesterov:
Accelerating the cubic regularization of Newton's method on convex problems. Math. Program. 112(1): 159-181 (2008) - [j25]Yurii E. Nesterov:
Rounding of convex sets and efficient gradient methods for linear programming problems. Optim. Methods Softw. 23(1): 109-128 (2008) - [j24]Catherine Fraikin, Yurii E. Nesterov, Paul Van Dooren:
Optimizing the Coupling Between Two Isometric Projections of Matrices. SIAM J. Matrix Anal. Appl. 30(1): 324-345 (2008) - 2007
- [j23]Yurii E. Nesterov:
Dual extrapolation and its applications to solving variational inequalities and related problems. Math. Program. 109(2-3): 319-344 (2007) - [j22]Yurii E. Nesterov:
Smoothing Technique and its Applications in Semidefinite Optimization. Math. Program. 110(2): 245-259 (2007) - [j21]Yurii E. Nesterov:
Modified Gauss-Newton scheme with worst case guarantees for global performance. Optim. Methods Softw. 22(3): 469-483 (2007) - 2006
- [j20]Yurii E. Nesterov, Boris T. Polyak:
Cubic regularization of Newton method and its global performance. Math. Program. 108(1): 177-205 (2006) - 2005
- [j19]Yurii E. Nesterov:
Smooth minimization of non-smooth functions. Math. Program. 103(1): 127-152 (2005) - [j18]Yurii E. Nesterov:
Lexicographic differentiation of nonsmooth functions. Math. Program. 104(2-3): 669-700 (2005) - [j17]Yurii E. Nesterov:
Excessive Gap Technique in Nonsmooth Convex Minimization. SIAM J. Optim. 16(1): 235-249 (2005) - [j16]Vincent D. Blondel, Yurii E. Nesterov:
Computationally Efficient Approximations of the Joint Spectral Radius. SIAM J. Matrix Anal. Appl. 27(1): 256-272 (2005) - 2004
- [b2]Yurii E. Nesterov:
Introductory Lectures on Convex Optimization - A Basic Course. Applied Optimization 87, Springer 2004, ISBN 978-1-4613-4691-3, pp. 1-236 - [j15]Yurii E. Nesterov, Jean-Philippe Vial:
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity. Math. Program. 99(1): 149-174 (2004) - [c3]Vincent D. Blondel, Yurii E. Nesterov, Jacques Theys:
Approximations of the Rate of Growth of Switched Linear Systems. HSCC 2004: 173-186 - 2003
- [j14]Yves V. Genin, Yvan Hachez, Yurii E. Nesterov, Paul Van Dooren:
Optimization Problems over Positive Pseudopolynomial Matrices. SIAM J. Matrix Anal. Appl. 25(1): 57-79 (2003) - 2002
- [j13]Yvan Hachez, Yurii E. Nesterov, Radu Stefan:
Positivity and Linear Matrix Inequalities. Eur. J. Control 8(3): 275-298 (2002) - [j12]Yurii E. Nesterov, Michael J. Todd:
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods. Found. Comput. Math. 2(4): 333-361 (2002)
1990 – 1999
- 1999
- [j11]Yurii E. Nesterov, Michael J. Todd, Yinyu Ye:
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. Math. Program. 84(2): 227-267 (1999) - [j10]Yurii E. Nesterov, Jean-Philippe Vial:
Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities. SIAM J. Optim. 9(3): 707-728 (1999) - [c2]Yves V. Genin, Yurii E. Nesterov, Paul Van Dooren:
Positive transfer functions and convex optimization. ECC 1999: 242-246 - [c1]Yves V. Genin, Yurii E. Nesterov, Paul Van Dooren:
The analytic center of LMI's and Riccati equations. ECC 1999: 3483-3487 - 1998
- [j9]Yurii E. Nesterov, Arkadi Nemirovski
Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods. Math. Oper. Res. 23(1): 1-38 (1998) - [j8]Yurii E. Nesterov, Michael J. Todd:
Primal-Dual Interior-Point Methods for Self-Scaled Cones. SIAM J. Optim. 8(2): 324-364 (1998) - 1997
- [j7]Yurii E. Nesterov, Michael J. Todd:
Self-Scaled Barriers and Interior-Point Methods for Convex Programming. Math. Oper. Res. 22(1): 1-42 (1997) - [j6]Yurii E. Nesterov:
Interior-point methods: An old and new approach to nonlinear programming. Math. Program. 79: 285-297 (1997) - 1996
- [j5]Yurii E. Nesterov:
Long-step strategies in interior-point primal-dual methods. Math. Program. 76: 47-94 (1996) - 1995
- [j4]Claude Lemaréchal, Arkadii Nemirovskii
New variants of bundle methods. Math. Program. 69: 111-147 (1995) - [j3]Yurii E. Nesterov:
Complexity estimates of some cutting plane methods based on the analytic barrier. Math. Program. 69: 149-176 (1995) - [j2]Yurii E. Nesterov, A. S. Nemirovskii
An interior-point method for generalized linear-fractional programming. Math. Program. 69: 177-204 (1995) - 1994
- [b1]Yurii E. Nesterov, Arkadii Nemirovskii
Interior-point polynomial algorithms in convex programming. Siam studies in applied mathematics 13, SIAM 1994, ISBN 978-0-89871-319-0, pp. I-VII, 1-405 - 1991
- [j1]Yurii E. Nesterov, Arkadii Nemirovskii:
Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem. SIAM J. Optim. 1(4): 548-564 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: