Geodesic
Local programming
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 41 (2001) no. 9, pp. 1324-1331 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2001_41_9_a5,
     author = {B. T. Polyak},
     title = {Local programming},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1324--1331},
     year = {2001},
     volume = {41},
     number = {9},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_9_a5/}
}
TY  - JOUR
AU  - B. T. Polyak
TI  - Local programming
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2001
SP  - 1324
EP  - 1331
VL  - 41
IS  - 9
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_9_a5/
LA  - ru
ID  - ZVMMF_2001_41_9_a5
ER  - 
%0 Journal Article
%A B. T. Polyak
%T Local programming
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2001
%P 1324-1331
%V 41
%N 9
%U http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_9_a5/
%G ru
%F ZVMMF_2001_41_9_a5
B. T. Polyak. Local programming. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 41 (2001) no. 9, pp. 1324-1331. http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_9_a5/

[1] Rokafellar R., Vypuklyi analiz, Mir, M., 1973

[2] Ioffe A. D., Tikhomirov V. M., Teoriya ekstremalnykh zadach, Nauka, M., 1974 | MR | Zbl

[3] Arkin V. I., “O beskonechnomernom analoge zadachi nevypuklogo programmirovaniya”, Kibernetika, 2:1 (1967), 87–93 | MR | Zbl

[4] Aumann R. J., Pedes M. A., “variational problem arising in economics”, J. Math. Analys. and Appl., 11 (1965), 488–503 | DOI | MR | Zbl

[5] Yakubovich V. A., “$S$-Protsedura v nelineinoi teorii upravleniya”, Vestn. LGU. Ser. matem., 1971, no. 1, 62–77 | Zbl

[6] Fradkov A. L., “Teoremy dvoistvennosti v nekotorykh nevypuklykh ekstremalnykh zadachakh”, Sibirskii matem. zhurnal, 1973, no. 2, 357–383 | MR | Zbl

[7] Matveev A. S., Yakubovich V. A., “Nevypuklye zadachi globalnoi optimizatsii v teorii upravleniya”, Itogi nauki i tekhn. Sovrem, matem. i ee prilozheniya, 60, VINITI, M., 1998, 128–175

[8] Polyak B. T., “Convexity of quadratic transformations and its use in control and optimization”, J. Optimizat. Theor. and Appl., 99:3 (1998), 553–583 | DOI | MR | Zbl

[9] Polyak B. T., “Gradientnye metody resheniya uravnenii i neravenstv”, Zh. vychisl. matem. i matem. fiz., 4:6 (1964), 995–1005

[10] Ortega D., Reinbold V., Iteratsionnye metody resheniya nelineinykh sistem uravnenii so mnogimi neizvestnymi, Mir, M., 1976

[11] Dmitruk A. V., Milyutin A. A., Osmolovskii N. M., “Teorema Lyusternika i teoriya ekstremuma”, Uspekhi matem. nauk, 55:6 (1980), 11–46 | MR

[12] Ioffe A. D., “On the local surjection property”, Nonlinear Analysis: Theory, Methods and Appl., 11:5 (1987), 565–592 | DOI | MR | Zbl

[13] Levitin E. C., Polyak B. T., “Metody minimizatsii pri nalichii ogranichenii”, Zh. vychisl. matem. i matem. fiz., 6:5 (1966), 787–823 | MR | Zbl

[14] Shor N. Z., Metody minimizatsii nedifferentsiruemykh funktsii i ikh prilozheniya, Nauk. dumka, Kiev, 1979 | MR | Zbl

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