Geodesic
A two-level subgradient method for finding saddle points of convex-concave functions
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 4, pp. 495-502 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1993_33_4_a1,
     author = {I. V. Konnov},
     title = {A two-level subgradient method for finding saddle points of convex-concave functions},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {495--502},
     year = {1993},
     volume = {33},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_4_a1/}
}
TY  - JOUR
AU  - I. V. Konnov
TI  - A two-level subgradient method for finding saddle points of convex-concave functions
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1993
SP  - 495
EP  - 502
VL  - 33
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_4_a1/
LA  - ru
ID  - ZVMMF_1993_33_4_a1
ER  - 
%0 Journal Article
%A I. V. Konnov
%T A two-level subgradient method for finding saddle points of convex-concave functions
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1993
%P 495-502
%V 33
%N 4
%U http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_4_a1/
%G ru
%F ZVMMF_1993_33_4_a1
I. V. Konnov. A two-level subgradient method for finding saddle points of convex-concave functions. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 4, pp. 495-502. http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_4_a1/

[1] Demyanov V. F., Pevnyi A. B., “Chislennye metody razyskaniya sedlovykh tochek”, Zh. vychisl. matem. i matem. fiz., 12:5 (1972), 1099–1127

[2] Golshtein E. G., “Obobschennyi gradientnyi metod otyskaniya sedlovykh tochek”, Ekonomika i matem. metody, 8:4 (1972), 569–579

[3] Golshtein E. G., Tretyakov N. V., Modifitsirovannye funktsii Lagranzha, Nauka, M., 1989 | MR

[4] Korpelevich G. M., “Ekstragradientnyi metod dlya otyskaniya sedlovykh tochek i drugikh zadach”, Ekonomika i matem. metody, 12:4 (1976), 747–756 | MR | Zbl

[5] Rzhevskii S. V., “Monotonnyi algoritm poiska sedlovoi tochki negladkoi funktsii”, Kibernetika, 1982, no. 1, 95–98 | MR

[6] Polyak B. T., Vvedenie v optimizatsiyu, Nauka, M., 1983 | MR

[7] Konnov I. V., Subgradientnyi metod posledovatelnoi relaksatsii dlya resheniya zadach optimizatsii, Dep. v VINITI 28.01.1983, No 531-83

[8] Konnov I. V., “Metod tipa sopryazhennykh subgradientov dlya minimizatsii funktsionalov”, Issled. po prikl. matem., 12, Kazan, 1984, 59–62 | MR | Zbl

[9] Konnov I. V., “Primenenie metoda posledovatelnoi relaksatsii k resheniyu ekstremalnykh zadach s polugladkimi funktsiyami”, Issled. po prikl. matem., 15, Kazan, 1988, 24–30

[10] Belenkii V. Z., Volkonskii V. A., Ivanov S. A. i dr., Iterativnye metody v teorii igr i programmirovanii, Nauka, M., 1974 | MR