activity
20042023
most citedGeneralized power method for sparse principal component analysis

500 citations · 1.2k across the 44 of their papers we have counts for

collaborators
Showing 2016 · math.OCShow all

5 papers · 2 filters

math.OC2016★ 4 cited

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

Haihao Lu, Robert M. Freund, Yurii Nesterov

The usual approach to developing and analyzing first-order methods for smooth convex optimization assumes that the gradient of the objective function is uniformly smooth with some…

math.OC2016

A Subgradient Method for Free Material Design

Michal Kocvara, Yurii Nesterov, Yu Xia

A small improvement in the structure of the material could save the manufactory a lot of money. The free material design can be formulated as an optimization problem. However, due…

math.OC2016

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

Alexander Gasnikov, Evgenia Gasnikova, Yurii Nesterov

We consider mixed model of traffic flow distribution in large networks (BMW model, 1954 & Stable Dynamic model, 1999). We build dual problem and consider primal-dual mirror descent…

math.OC2016★ 12 cited

Universal fast gradient method for stochastic composit optimization problems

Alexander Gasnikov, Yurii Nesterov

We propose a new simple variant of Fast Gradient Method that requires only one projection per iteration. We called this method Triangle Method (TM) because it has a corresponding g…

math.OC2016★ 38 cited

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

Lev Bogolubsky, Pavel Dvurechensky, Alexander Gasnikov +5

In this paper, we consider a non-convex loss-minimization problem of learning Supervised PageRank models, which can account for some properties not considered by classical approach…