An optimal method of constructing an $\varepsilon$-subgradient
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 3, pp. 456-458
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{ZVMMF_1993_33_3_a12,
author = {N. T. Aliev},
title = {An optimal method of constructing an $\varepsilon$-subgradient},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {456--458},
year = {1993},
volume = {33},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_3_a12/}
}
N. T. Aliev. An optimal method of constructing an $\varepsilon$-subgradient. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 3, pp. 456-458. http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_3_a12/
[1] Lemarechal C., “An algorithm for minimizing convex functions”, Proc. IFIP, Congress-74, Amsterdam, 1974, 552–556 | MR | Zbl
[2] Kiewel K., “Methods of descent for nondifferentiable optimization”, Lect. Notes Math., 1133, Springer, Berlin, 1985 | MR
[3] Aliev N. T., Razrabotka $\varepsilon$-subgradientnykh algoritmov, ispolzuyuschikh operatsiyu rastyazheniya prostranstva, Dep. v VINITI 27.08.85, No 6346-85 Dep.