Search Results - "Nesterov, Yu"
-
1
Gradient methods for minimizing composite functions
Published in Mathematical programming (01-08-2013)“…In this paper we analyze several new methods for solving optimization problems with the objective function formed as a sum of two terms: one is smooth and…”
Get full text
Journal Article -
2
Linear convergence of first order methods for non-strongly convex optimization
Published in Mathematical programming (01-05-2019)“…The standard assumption for proving linear convergence of first order methods for smooth convex optimization is the strong convexity of the objective function,…”
Get full text
Journal Article -
3
Smooth minimization of non-smooth functions
Published in Mathematical programming (01-05-2005)Get full text
Journal Article -
4
Accelerating the cubic regularization of Newton’s method on convex problems
Published in Mathematical programming (01-03-2008)“…In this paper we propose an accelerated version of the cubic regularization of Newton’s method (Nesterov and Polyak, in Math Program 108(1): 177–205, 2006)…”
Get full text
Journal Article Conference Proceeding -
5
Universal Method for Stochastic Composite Optimization Problems
Published in Computational mathematics and mathematical physics (2018)“…A fast gradient method requiring only one projection is proposed for smooth convex optimization problems. The method has a visual geometric interpretation, so…”
Get full text
Journal Article -
6
The Problem of the Subject in Artificial Nature
Published in Gumanitarnyj vektor (01-04-2021)“…The article discusses the situation with the subject and subjectivity that arises in the conditions of scientific and technological progress. The concept of…”
Get full text
Journal Article -
7
Accelerated Primal-Dual Gradient Descent with Linesearch for Convex, Nonconvex, and Nonsmooth Optimization Problems
Published in Doklady. Mathematics (01-03-2019)“…A new version of accelerated gradient descent is proposed. The method does not require any a priori information on the objective function, uses a linesearch…”
Get full text
Journal Article -
8
Efficient numerical methods for entropy-linear programming problems
Published in Computational mathematics and mathematical physics (01-04-2016)“…Entropy-linear programming (ELP) problems arise in various applications. They are usually written as the maximization of entropy (minimization of minus…”
Get full text
Journal Article -
9
Lexicographic differentiation of nonsmooth functions
Published in Mathematical programming (01-11-2005)“…We present a survey on the results related to the theory of lexicographic differentiation. This theory ensures an efficient computation of generalized (…”
Get full text
Journal Article -
10
Universal gradient methods for convex optimization problems
Published in Mathematical programming (01-08-2015)“…In this paper, we present new methods for black-box convex minimization. They do not need to know in advance the actual level of smoothness of the objective…”
Get full text
Journal Article -
11
Dual Methods for Finding Equilibriums in Mixed Models of Flow Distribution in Large Transportation Networks
Published in Computational mathematics and mathematical physics (01-09-2018)“…The problem of equilibrium distribution of flows in a transportation network in which a part of edges are characterized by cost functions and the other edges…”
Get full text
Journal Article -
12
Magnetic Nanoparticles Produced by Pulsed Laser Ablation of Thin Cobalt Films in Water
Published in Bulletin of the Russian Academy of Sciences. Physics (01-04-2024)“…The possibility of synthesizing nanoparticles by pulsed laser ablation of thin cobalt films in water is shown. The average size of the formed nanoparticles…”
Get full text
Journal Article -
13
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Published in Mathematics of operations research (01-02-1997)“…This paper provides a theoretical foundation for efficient interior-point algorithms for convex programming problems expressed in conic form, when the cone and…”
Get full text
Journal Article -
14
Complexity bounds for primal-dual methods minimizing the model of objective function
Published in Mathematical programming (01-09-2018)“…We provide Frank–Wolfe ( ≡ Conditional Gradients) method with a convergence analysis allowing to approach a primal-dual solution of convex optimization problem…”
Get full text
Journal Article -
15
On the efficiency of a randomized mirror descent algorithm in online optimization problems
Published in Computational mathematics and mathematical physics (01-04-2015)“…A randomized online version of the mirror descent method is proposed. It differs from the existing versions by the randomization method. Randomization is…”
Get full text
Journal Article -
16
ENERGY APPROACH TO ESTIMATING THE QUALITY OF THE SPRAY GENERATED BY A MODEL PNEUMATIC ATOMIZER
Published in Journal of applied mechanics and technical physics (2024)“…The efficiency of fluid atomization by an atomizer is studied as a function of the spray energy. The dependence of the maximum values of energy on the fluid…”
Get full text
Journal Article -
17
Subgradient methods for huge-scale optimization problems
Published in Mathematical programming (01-08-2014)“…We consider a new class of huge-scale problems, the problems with sparse subgradients . The most important functions of this type are piece-wise linear. For…”
Get full text
Journal Article -
18
Structure of a supersonic gas-liquid jet at high liquid concentrations
Published in Thermophysics and aeromechanics (01-09-2023)“…Supersonic gas-liquid jets of a coaxial atomizer at high liquid concentrations are studied experimentally. A complex of optical techniques is used for studying…”
Get full text
Journal Article -
19
Characteristic functions of directed graphs and applications to stochastic equilibrium problems
Published in Optimization and engineering (01-06-2007)“…In this paper we introduce the notions of characteristic and potential functions of directed graphs and study their properties. The main motivation for our…”
Get full text
Journal Article -
20
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods
Published in Foundations of computational mathematics (01-11-2002)“…We consider the Riemannian geometry defined on a convex set by the Hessian of a self-concordant barrier function, and its associated geodesic curves. These…”
Get full text
Journal Article