Yuri Nesterov

From MaRDI portal
Person:327227

Available identifiers

zbMath Open nesterov.yuriiDBLP00/343WikidataQ3573263 ScholiaQ3573263MaRDI QIDQ327227

List of research outcomes





PublicationDate of PublicationType
Primal subgradient methods with predefined step sizes2024-12-27Paper
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods2024-11-07Paper
Set-limited functions and polynomial-time interior-point methods2024-09-02Paper
Gradient regularization of Newton method with Bregman distances2024-02-21Paper
Correction to: ``Computation of Fisher-Gale equilibrium by auction2024-02-09Paper
Super-Universal Regularized Newton Method2024-01-17Paper
High-Order Reduced-Gradient Methods for Composite Variational Inequalities2023-11-25Paper
Primal subgradient methods with predefined stepsizes2023-11-23Paper
Adaptive Third-Order Methods for Composite Convex Optimization2023-08-11Paper
Conic optimization-based algorithms for nonnegative matrix factorization2023-08-09Paper
Convex quartic problems: homogenized gradient method and preconditioning2023-06-30Paper
Subgradient ellipsoid method for nonsmooth convex problems2023-05-02Paper
Inexact accelerated high-order proximal-point methods2023-03-14Paper
Affine-invariant contracting-point methods for convex optimization2023-03-01Paper
Gradient Methods for Stochastic Optimization in Relative Scale2023-01-19Paper
Inexact basic tensor methods for some classes of convex optimization problems2022-10-06Paper
Efficient numerical methods to solve sparse linear equations with application to PageRank2022-10-06Paper
Gradient methods with memory2022-10-06Paper
Tensor methods for finding approximate stationary points of convex functions2022-09-30Paper
High-Order Optimization Methods for Fully Composite Problems2022-09-29Paper
Soft clustering by convex electoral model2022-07-21Paper
Rates of superlinear convergence for classical quasi-Newton methods2022-06-29Paper
Primal–dual accelerated gradient methods with small-dimensional relaxation oracle2022-06-27Paper
Discrete Choice Prox-Functions on the Simplex2022-05-17Paper
Local convergence of tensor methods2022-04-29Paper
Dynamic pricing under nested logit demand2022-02-01Paper
Quartic Regularity2022-01-13Paper
Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure2021-12-01Paper
Superfast second-order methods for unconstrained convex optimization2021-11-18Paper
High-order methods beyond the classical complexity bounds, II: inexact high-order proximal-point methods with segment search2021-09-25Paper
High-order methods beyond the classical complexity bounds, I: inexact high-order proximal-point methods2021-07-13Paper
New results on superlinear convergence of classical quasi-Newton methods2021-06-15Paper
Minimizing uniformly convex functions by cubic regularization of Newton method2021-06-15Paper
Computation of the analytic center of the solution set of the linear matrix inequality arising in continuous- and discrete-time passivity analysis2021-04-29Paper
On inexact solution of auxiliary problems in tensor methods for convex optimization2021-04-15Paper
Optimization Methods for Fully Composite Problems2021-03-23Paper
Greedy Quasi-Newton Methods with Explicit Superlinear Convergence2021-03-10Paper
Implementable tensor methods in unconstrained convex optimization2021-02-15Paper
Contracting Proximal Methods for Smooth Convex Optimization2020-12-11Paper
Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives2020-10-08Paper
Affine-invariant contracting-point methods for Convex Optimization2020-09-18Paper
Convex optimization based on global lower second-order models2020-06-15Paper
Smoothness parameter of power of Euclidean norm2020-05-11Paper
On the quality of first-order approximation of functions with Hölder continuous gradient2020-04-07Paper
Inexact Tensor Methods with Dynamic Accuracies2020-02-21Paper
Computing Closest Stable Nonnegative Matrix2020-01-17Paper
Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems2019-07-18Paper
Tensor Methods for Finding Approximate Stationary Points of Convex Functions2019-07-13Paper
Linear convergence of first order methods for non-strongly convex optimization2019-05-17Paper
Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks2019-01-15Paper
Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions2019-01-14Paper
Computation of Fisher-Gale equilibrium by auction2018-08-10Paper
Lectures on convex optimization2018-07-23Paper
Universal method for stochastic composite optimization problems2018-04-25Paper
Relatively Smooth Convex Optimization by First-Order Methods, and Applications2018-02-14Paper
Random block coordinate descent methods for linearly constrained optimization over networks2017-09-01Paper
Distributed price adjustment based on convex analysis2017-06-22Paper
Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians2017-05-30Paper
Random gradient-free minimization of convex functions2017-05-23Paper
Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems2017-01-31Paper
Algorithmic Principle of Least Revenue for Finding Market Equilibria2017-01-27Paper
A subgradient method for free material design2016-11-15Paper
Efficient numerical methods for entropy-linear programming problems2016-10-19Paper
Excessive revenue model of competitive markets2016-09-02Paper
Finding the stationary states of Markov chains by iterative methods2016-06-22Paper
Primal-dual method for searching equillibriums in mixed traffic assignment problems2016-04-27Paper
Universal fast gradient method for stochastic composit optimization problems2016-04-18Paper
Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods2016-03-02Paper
Primal-dual methods for solving infinite-dimensional games2015-09-03Paper
Nearest stable system using successive convex approximations2015-08-27Paper
On the efficiency of a randomized mirror descent algorithm in online optimization problems2015-07-13Paper
Universal method with inexact oracle and its applications for searching equillibriums in multistage transport problems2015-05-31Paper
On the three-stage version of stable dynamic model2015-02-18Paper
Primal-Dual Subgradient Method for Huge-Scale Linear Conic Problems2014-12-12Paper
Stochastic gradient methods with inexact oracle2014-11-16Paper
Learning Supervised PageRank with Gradient-Free Optimization Methods2014-11-16Paper
Entropy linear programming2014-10-28Paper
Efficient randomized mirror descents in stochastic online convex optimization2014-10-12Paper
Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization2014-10-07Paper
First-order methods of smooth convex optimization with inexact oracle2014-08-29Paper
Subgradient methods for huge-scale optimization problems2014-08-29Paper
Positivity and linear matrix inequalities2014-08-07Paper
On first-order algorithms forl1/nuclear norm minimization2014-06-11Paper
Confidence level solutions for stochastic programming2014-03-19Paper
Primal-dual subgradient methods for minimizing uniformly convex functions2014-01-08Paper
Optimizing the spectral radius2013-12-13Paper
Gradient methods for minimizing composite functions2013-08-12Paper
Hessian distances and their applications in the complexity analysis of interior-point methods2013-06-24Paper
Towards non-symmetric conic optimization2012-11-06Paper
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes2012-11-02Paper
Efficiency of coordinate descent methods on huge-scale optimization problems2012-09-12Paper
Double smoothing technique for large-scale linearly constrained convex optimization2012-09-12Paper
Generalized power method for sparse principal component analysis2012-07-13Paper
Design and operations of gas transmission networks2012-06-18Paper
Solving strongly monotone variational and quasi-variational inequalities2011-12-20Paper
https://portal.mardi4nfdi.de/entity/Q30967252011-11-11Paper
Unconstrained Convex Minimization in Relative Scale2011-04-27Paper
Barrier subgradient method2011-03-31Paper
Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices2010-08-19Paper
Primal central paths and Riemannian distances for convex sets2009-07-13Paper
Primal-dual subgradient methods for convex problems2009-05-05Paper
Optimizing the Coupling Between Two Isometric Projections of Matrices2009-03-06Paper
A gradient-type algorithm optimizing the coupling between matrices2008-08-06Paper
Hybrid Systems: Computation and Control2007-09-25Paper
Primal-dual subgradient methods for convex problems2007-06-19Paper
Smoothing technique and its applications in semidefinite optimization2007-05-10Paper
Dual extrapolation and its applications to solving variational inequalities and related problems2007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q54941482006-10-17Paper
Cubic regularization of Newton method and its global performance2006-06-28Paper
Computationally Efficient Approximations of the Joint Spectral Radius2005-09-19Paper
Optimization Problems over Non-negative Polynomials with Interpolation Constraints2005-06-24Paper
On the accuracy of the ellipsoid norm approximation of the joint spectral radius2005-02-23Paper
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity2004-03-11Paper
Optimization Problems over Positive Pseudopolynomial Matrices2004-01-18Paper
Introductory lectures on convex optimization. A basic course.2004-01-05Paper
On the Riemannian geometry defined by self-concordant barriers and interior-point methods.2003-06-23Paper
Multi-parameter surfaces of analytic centers and long-step surface-following interior point methods2001-11-26Paper
Homogeneous analytic center cutting plane methods with approximate centers2000-12-06Paper
https://portal.mardi4nfdi.de/entity/Q45171082000-11-23Paper
https://portal.mardi4nfdi.de/entity/Q44960252000-10-23Paper
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems2000-07-21Paper
Stable traffic equilibria: Properties and applications2000-01-01Paper
Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities1999-11-24Paper
Primal-Dual Interior-Point Methods for Self-Scaled Cones1998-05-12Paper
Self-Scaled Barriers and Interior-Point Methods for Convex Programming1997-06-09Paper
An interior-point method for generalized linear-fractional programming1996-09-18Paper
New variants of bundle methods1996-09-18Paper
https://portal.mardi4nfdi.de/entity/Q48871031996-08-25Paper
Oligopolistic Competition and the Optimal Provision of Products1996-01-07Paper
https://portal.mardi4nfdi.de/entity/Q43249801995-03-06Paper
Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q34961531990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34744821989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38095871988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37969591988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34846321988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38263621988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37917661987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38028961987-01-01Paper
Optimal methods of smooth convex minimization1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36864441984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33476461984-01-01Paper
One class of methods of unconditional minimization of a convex function, having a high rate of convergence1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37068561984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33201321983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39531001982-01-01Paper
On a one-dimensional search procedure in methods of unconstrained minimization of a function of several variables1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39680541980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47422301980-01-01Paper
An optimal lower bound for smooth convex functionsN/APaper

Research outcomes over time

This page was built for person: Yuri Nesterov