Geodesic
A method of solving a convex programming problem with convergence rate $O\bigl(\frac1{k^2}\bigr)$
Doklady Akademii Nauk, Tome 269 (1983) no. 3, pp. 543-547.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DAN_1983_269_3_a6,
     author = {Yu. E. Nesterov},
     title = {A method of solving a convex programming problem with convergence rate $O\bigl(\frac1{k^2}\bigr)$},
     journal = {Doklady Akademii Nauk},
     pages = {543--547},
     publisher = {mathdoc},
     volume = {269},
     number = {3},
     year = {1983},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1983_269_3_a6/}
}
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  - 
%0 Journal Article
%A Yu. E. Nesterov
%T A method of solving a convex programming problem with convergence rate $O\bigl(\frac1{k^2}\bigr)$
%J Doklady Akademii Nauk
%D 1983
%P 543-547
%V 269
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1983_269_3_a6/
%G ru
%F DAN_1983_269_3_a6
Yu. E. Nesterov. A method of solving a convex programming problem with convergence rate $O\bigl(\frac1{k^2}\bigr)$. Doklady Akademii Nauk, Tome 269 (1983) no. 3, pp. 543-547. http://geodesic.mathdoc.fr/item/DAN_1983_269_3_a6/