Geodesic
A concave programming under the simplest linear constraints
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 43 (2003) no. 7, pp. 951-960 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2003_43_7_a2,
     author = {A. I. Rusakov},
     title = {A concave programming under the simplest linear constraints},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {951--960},
     year = {2003},
     volume = {43},
     number = {7},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2003_43_7_a2/}
}
TY  - JOUR
AU  - A. I. Rusakov
TI  - A concave programming under the simplest linear constraints
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2003
SP  - 951
EP  - 960
VL  - 43
IS  - 7
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2003_43_7_a2/
LA  - ru
ID  - ZVMMF_2003_43_7_a2
ER  - 
%0 Journal Article
%A A. I. Rusakov
%T A concave programming under the simplest linear constraints
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2003
%P 951-960
%V 43
%N 7
%U http://geodesic.mathdoc.fr/item/ZVMMF_2003_43_7_a2/
%G ru
%F ZVMMF_2003_43_7_a2
A. I. Rusakov. A concave programming under the simplest linear constraints. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 43 (2003) no. 7, pp. 951-960. http://geodesic.mathdoc.fr/item/ZVMMF_2003_43_7_a2/

[1] Khachaturov V. R., Utkin S. L., Reshenie mnogoekstremalnykh zadach vognutogo programmirovaniya approksimatsionno-kombinatornym metodom, VTs AN SSSR, M., 1988 | MR

[2] Utkin S. L., Khachaturov V. R., Khoang Tui, “O konusnykh algoritmakh dlya resheniya zadachi vognutogo programmirovaniya i nekotorykh ee obobschenii”, Zh. vychisl. matem. i matem. fiz., 28:7 (1988), 992–999 | MR | Zbl

[3] Hoang Tuy, Khatchaturov V., Utkin S., “A class of exhaustive cone splitting procedures in conical algorithms for concave minimization”, Optimization, 1987, no. 18, 791–807 | MR | Zbl

[4] Belousov E. G., Vvedenie v vypuklyi analiz i tselochislennoe programmirovanie, Izd-vo MGU, M., 1977 | MR | Zbl

[5] Kolmogorov A. N., Fomin S. V., Elementy teorii funktsii i funktsionalnogo analiza, Nauka, M., 1981 | MR

[6] Rusakov A. I., “Proverka gipotez o raspredelenii vektora sostoyaniya sistemy po serii regressionnykh eksperimentov v usloviyakh multikollinearnosti”, Avtomatika i telemekhan., 1996, no. 5, 82–95 | MR | Zbl

[7] Rusakov A. I., “Priemochnyi kontrol tekhnicheskikh ob'ektov po sostavlyayuschim tselevoi kharakteristiki”, Avtomatika i telemekhan., 1999, no. 2, 172–179 | Zbl

[8] Tuy H., Concave minimization under linear constraints with special structure, Hanoi Inst. Math., Hanoi, 1983

[9] Khoang Tui, “Vognutoe programmirovanie pri lineinykh ogranicheniyakh”, Dokl. AN SSSR, 159:1 (1964), 32–35 | MR

[10] Burkov V. N., Lazebnik A. I., Khranovich I. L., “Metod vetvei i granits kak regulyarnyi metod resheniya neregulyarnykh zadach matematicheskogo programmirovaniya. I; II”, Avtomatika i telemekhan., 1972, no. 7, 169–177 ; No 10, 138–147 | MR | Zbl | MR | Zbl

[11] Demidenko E. Z., Lineinaya i nelineinaya regressii, Finansy i statistika, M., 1981 | MR

[12] Rusakov A. I., “Uluchshennyi algoritm reduktsii dlya proverki gipotez pri multikollinearnoi modeli regressii”, Avtomatika i telemekhan., 2001, no. 5, 94–104 | MR | Zbl