TY  - JOUR
AU  - Yu. E. Nesterov
TI  - A method of solving a convex programming problem with convergence rate $O\bigl(\frac1{k^2}\bigr)$
JO  - Doklady Akademii Nauk
PY  - 1983
SP  - 543
EP  - 547
VL  - 269
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1983_269_3_a6/
LA  - ru
ID  - DAN_1983_269_3_a6
ER  -