Primal-dual subgradient methods for convex problems
Year of publication: |
2005-10
|
---|---|
Authors: | NESTEROV, Yu. |
Institutions: | Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain |
Subject: | convex optimization | subgradient methods | non-smooth optimization | minimax problems | saddle points | variational inequalities | stochastic optimization | black-box methods | lower complexity bounds |
-
NESTEROV, Y., (2008)
-
Minimizing functions with bounded variation of subgradients
NESTEROV, Yu., (2005)
-
Dual extrapolation and its applications for solving variational inequalities and related problems
NESTEROV, Yu, (2003)
- More ...
-
Advances in nonlinear convex op
NESTEROV, Yu.,
-
Computationally efficient approximations of the joint spectral radius
BLONDEL, Vincent D.,
-
Optimizat problems over positive pseudopolynomial matrices
GENIN, Yves,
- More ...