Search

Your search keyword '"NESTEROV, YURII"' showing total 390 results

Search Constraints

Start Over You searched for: Author "NESTEROV, YURII" Remove constraint Author: "NESTEROV, YURII" Search Limiters Available in Library Collection Remove constraint Search Limiters: Available in Library Collection
390 results on '"NESTEROV, YURII"'

Search Results

1. Improved global performance guarantees of second-order methods in convex minimization

2. An optimal lower bound for smooth convex functions

3. High-Order Reduced-Gradient Methods for Composite Variational Inequalities

4. Primal subgradient methods with predefined stepsizes

5. Convex quartic problems: homogenized gradient method and preconditioning

6. Gradient Methods for Stochastic Optimization in Relative Scale

7. Super-Universal Regularized Newton Method

8. Adaptive Third-Order Methods for Composite Convex Optimization

9. Quartic Regularity

10. Gradient Regularization of Newton Method with Bregman Distances

11. High-order methods beyond the classical complexity bounds, II: inexact high-order proximal-point methods with segment search

12. High-order methods beyond the classical complexity bounds, I: inexact high-order proximal-point methods

13. Subgradient Ellipsoid Method for Nonsmooth Convex Problems

14. Conic-Optimization Based Algorithms for Nonnegative Matrix Factorization

15. Gradient Methods with Memory

16. Optimization Methods for Fully Composite Problems

17. Dynamic pricing under nested logit demand

18. Affine-invariant contracting-point methods for Convex Optimization

19. Online analysis of epidemics with variable infection rate

20. Convex optimization based on global lower second-order models

21. New Results on Superlinear Convergence of Classical Quasi-Newton Methods

22. Rates of superlinear convergence for classical quasi-Newton methods

23. Stochastic Subspace Cubic Newton Method

24. Inexact Tensor Methods with Dynamic Accuracies

25. Greedy Quasi-Newton Methods with Explicit Superlinear Convergence

26. On the Quality of First-Order Approximation of Functions with H\'older Continuous Gradient

27. Contracting Proximal Methods for Smooth Convex Optimization

28. Local convergence of tensor methods

29. Discrete choice prox-functions on the simplex

30. On Inexact Solution of Auxiliary Problems in Tensor Methods for Convex Optimization

31. Smoothness parameter of power of Euclidean norm

32. Tensor Methods for Finding Approximate Stationary Points of Convex Functions

33. Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Method

34. Tensor Methods for Minimizing Convex Functions with H\'{o}lder Continuous Higher-Order Derivatives

35. Computation of the analytic center of the solution set of the linear matrix inequality arising in continuous- and discrete-time passivity analysis

36. Primal-dual accelerated gradient methods with small-dimensional relaxation oracle

37. Relatively-Smooth Convex Optimization by First-Order Methods, and Applications

38. A Subgradient Method for Free Material Design

39. Primal-dual method for searching equillibriums in mixed traffic assignment problems

40. Universal fast gradient method for stochastic composit optimization problems

41. Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods

42. Efficient Numerical Methods to Solve Sparse Linear Equations with Application to PageRank

43. Universal method with inexact oracle and its applications for searching equillibriums in multistage transport problems

44. Learning Supervised PageRank with Gradient-Free Optimization Methods

45. Stochastic gradient methods with inexact oracle

46. Entropy linear programming

47. Efficient randomized mirror descents in stochastic online convex optimization

48. On the three-stage version of stable dynamic model

49. Generalized power method for sparse principal component analysis

50. Computationally efficient approximations of the joint spectral radius

Catalog

Books, media, physical & digital resources