Geodesic
On the stability of algorithms for the unconditional minimization of pseudoconvex functions
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2000), pp. 33-48.

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

@article{IVM_2000_12_a5,
     author = {I. Ya. Zabotin},
     title = {On the stability of algorithms for the unconditional minimization of pseudoconvex functions},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {33--48},
     publisher = {mathdoc},
     number = {12},
     year = {2000},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2000_12_a5/}
}
TY  - JOUR
AU  - I. Ya. Zabotin
TI  - On the stability of algorithms for the unconditional minimization of pseudoconvex functions
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2000
SP  - 33
EP  - 48
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2000_12_a5/
LA  - ru
ID  - IVM_2000_12_a5
ER  - 
%0 Journal Article
%A I. Ya. Zabotin
%T On the stability of algorithms for the unconditional minimization of pseudoconvex functions
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2000
%P 33-48
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2000_12_a5/
%G ru
%F IVM_2000_12_a5
I. Ya. Zabotin. On the stability of algorithms for the unconditional minimization of pseudoconvex functions. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2000), pp. 33-48. http://geodesic.mathdoc.fr/item/IVM_2000_12_a5/

[1] Babich M. D., Ivanov V. V., “Issledovanie polnoi pogreshnosti v zadachakh minimizatsii funktsionalov pri nalichii ogranichenii”, Ukr. matem. zhurn., 21:1 (1969), 3–14 | Zbl

[2] Vasilev F. P., Metody resheniya ekstremalnykh zadach. Zadachi minimizatsii v funktsionalnykh prostranstvakh, regulyarizatsiya, approksimatsiya, Ucheb. posobie, Nauka, M., 1981, 400 pp. | MR

[3] Golshtein E. G., Tretyakov N. V., “Gradientnyi metod minimizatsii i algoritmy vypuklogo programmirovaniya, svyazannye s modifitsirovannymi funktsiyami Lagranzha”, Ekonomika i matem. metody, 11:4 (1975), 730–742 | MR

[4] Lyubich Yu. I., Maistrovskii G. D., “Obschaya teoriya relaksatsionnykh protsessov dlya vypuklykh funktsionalov”, UMN, 25:1 (1970), 57–112 | MR | Zbl

[5] Polyak B. T., Vvedenie v optimizatsiyu, Nauka, M., 1983, 384 pp. | MR

[6] Bazara M., Shetti K., Nelineinoe programmirovanie. Teoriya i algoritmy, Mir, M., 1982, 583 pp. | MR | Zbl

[7] Bakhvalov N. S., Chislennye metody. Analiz, algebra, obyknovennye differentsialnye uravneniya, Ucheb. posobie, Nauka, M., 1973, 631 pp. | MR | Zbl

[8] Zabotin I. Ya., “Ob odnom podkhode k postroeniyu algoritmov bezuslovnoi minimizatsii psevdovypuklykh funktsii”, Izv. vuzov. Matematika, 1998, no. 12, 29–39 | MR | Zbl

[9] Vasilev F. P., Chislennye metody resheniya ekstremalnykh zadach, Nauka, M., 1988, 552 pp. | MR

[10] Karmanov V. G., Matematicheskoe programmirovanie, Ucheb. posobie. 3-e izd., Nauka, M., 1986, 288 pp. | MR

[11] Korablev A. I., “O relaksatsionnykh metodakh minimizatsii psevdovypuklykh funktsii”, Issled. po prikl. matem., 8, Kazan, 1980, 3–8 | MR | Zbl

[12] Tretyakov A. A., “Dve skhemy nelineinogo metoda optimizatsii v ekstremalnykh zadachakh”, Zhurn. vychisl. matem. i matem. fiz., 24:7 (1984), 986–992 | MR

[13] Moiseev N. N., Chislennye metody v teorii optimalnykh sistem, Nauka, M., 1971, 424 pp. | MR

[14] Pshenichnyi B. N., Danilin Yu. M., Chislennye metody v ekstremalnykh zadachakh, Nauka, M., 1975, 320 pp. | MR

[15] Zabotin I. Ya., “K voprosu o vybore napravlenii spuska v zadachakh bezuslovnoi minimizatsii funktsii”, Issled. po prikl. matem., 9, Kazan, 1981, 37–42 | MR

[16] Khimmelblau D., Prikladnoe nelineinoe programmirovanie, Mir, M., 1975, 536 pp.

[17] Zavriev S. K., “Ob ustoichivosti vychislitelnoi skhemy metoda sopryazhennykh gradientov”, Vopr. kibernetiki. Analiz bolshikh sistem, M., 1992, 102–118

[18] Khoteev S. V., “O mnogoshagovykh gradientnykh metodakh v zadachakh optimizatsii”, Vopr. kibernetiki. Modeli i metody analiza bolshikh sistem, M., 1991, 104–111 | MR | Zbl

[19] Minu M., Matematicheskoe programmirovanie. Teoriya i algoritmy, Nauka, M., 1990, 488 pp. | MR