Rounding of convex sets and efficient gradient methods for linear programming problems
Year of publication: |
2004-02
|
---|---|
Authors: | NESTEROV, Yu |
Institutions: | Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain |
Subject: | nonlinear optimization | convex optimization | complexity bounds | relative accuracy | fully polynomial approximation schemes | gradient methods | optimal methods |
-
Unconstrained convex minimization in relative scale
NESTEROV, Yu, (2003)
-
Universal gradient methods for convex optimization problems
NESTEROV, Yurii, (2013)
-
First-order methods of smooth convex optimization with inexact oracle
DEVOLDER, Olivier, (2011)
- More ...
-
Confidence level solutions for stochastic programming
NESTEROV, Yu, (2000)
-
Dual extrapolation and its applications for solving variational inequalities and related problems
NESTEROV, Yu, (2003)
-
Stable dynamics in transportation systems.
NESTEROV, Yu, (2000)
- More ...