An $\varepsilon$-subgradient method for solving convex programming problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 21 (1981) no. 5, pp. 1126-1132
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{ZVMMF_1981_21_5_a5,
author = {S. V. Rzhevskii},
title = {An $\varepsilon$-subgradient method for solving convex programming problems},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {1126--1132},
year = {1981},
volume = {21},
number = {5},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1981_21_5_a5/}
}
TY - JOUR AU - S. V. Rzhevskii TI - An $\varepsilon$-subgradient method for solving convex programming problems JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 1981 SP - 1126 EP - 1132 VL - 21 IS - 5 UR - http://geodesic.mathdoc.fr/item/ZVMMF_1981_21_5_a5/ LA - ru ID - ZVMMF_1981_21_5_a5 ER -
S. V. Rzhevskii. An $\varepsilon$-subgradient method for solving convex programming problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 21 (1981) no. 5, pp. 1126-1132. http://geodesic.mathdoc.fr/item/ZVMMF_1981_21_5_a5/