Geodesic
Methods of Chebyshev points of convex sets and their applications
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 48 (2008) no. 1, pp. 18-32 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Chebyshev points of bounded convex sets, search algorithms for them, and various applications to convex programming are considered for simple approximations of reachable sets, optimal control, global optimization of additive functions on convex polyhedra, and integer programming. The problem of searching for Chebyshev points in multicriteria models of development and operation of electric power systems is considered. 
@article{ZVMMF_2008_48_1_a1,
     author = {T. I. Belykh and V. P. Bulatov and \`E. N. Yas'kova},
     title = {Methods of {Chebyshev} points of convex sets and their applications},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {18--32},
     year = {2008},
     volume = {48},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_1_a1/}
}
TY  - JOUR
AU  - T. I. Belykh
AU  - V. P. Bulatov
AU  - È. N. Yas'kova
TI  - Methods of Chebyshev points of convex sets and their applications
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2008
SP  - 18
EP  - 32
VL  - 48
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_1_a1/
LA  - ru
ID  - ZVMMF_2008_48_1_a1
ER  - 
%0 Journal Article
%A T. I. Belykh
%A V. P. Bulatov
%A È. N. Yas'kova
%T Methods of Chebyshev points of convex sets and their applications
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2008
%P 18-32
%V 48
%N 1
%U http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_1_a1/
%G ru
%F ZVMMF_2008_48_1_a1
T. I. Belykh; V. P. Bulatov; È. N. Yas'kova. Methods of Chebyshev points of convex sets and their applications. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 48 (2008) no. 1, pp. 18-32. http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_1_a1/

[1] Zukhovitskii S. I., Avdeeva L. I., Lineinoe i vypukloe programmirovanie, Nauka, M., 1967 | MR

[2] Bulatov V. P., Metod approksimatsii pri reshenii nekotorykh ekstremalnykh zadach, Dis. $\dots$ kand. fiz.-matem. nauk, Tomsk. un-t, 1967

[3] Bulatov V. P., Metody pogruzheniya v zadachakh optimizatsii, Nauka, Novosibirsk, 1977 | MR | Zbl

[4] Zukhovitskii S. I., Polyak P. A., Primak M. E., “Dva metoda stykovaniya tochek ravnovesiya vognutykh igr $n$ lits”, Dokl. AN SSSR, 185:1 (1969), 24–27 | MR

[5] Nenakhov E. I., Primak M. E., “O skhodimosti metoda chebyshevskikh tsentrov i nekotorykh ego prilozheniyakh”, Kibernetika, 1986, no. 2, 60–65 | MR | Zbl

[6] Primak M. E., “O skhodimosti modifitsirovannogo metoda chebyshevskikh tsentrov dlya resheniya zadach vognutogo programmirovaniya”, Kibernetika, 1977, no. 5, 100–102 | MR | Zbl

[7] Primak M. E., “O skhodimosti metoda otsecheniya s ochistkoi na kazhdom shage”, Kibernetika, 1980, no. 1, 119–121 | MR | Zbl

[8] Elzinda J., Moore T. G., “A central cutting plane algorithm for the convex programming problems”, Math. Program., 8 (1975), 134–145 | DOI | MR

[9] Bulatov V., Belykh T., Burdiikovskaja A., “Methods of the Chebyshev points for some problems of operations research”, Proc. 13-th Baikal Internat. School-Seminar. Optimizat. methods and their applic., v. 1, Irkutsk, 2005, 37–51 | MR

[10] Chernousko F. A., “Optimalnye garantirovannye otsenki neopredelennostei s pomoschyu ellipsoidov. Ch. II”, Tekhn. kibernetika, 1980, no. 4 | MR

[11] Ovsevich A. I., Reshetnyak Yu. N., “Approksimatsiya peresecheniya ellipsoidov v zadachakh garantirovannogo otsenivaniya”, Tekhn. kibernetika, 1988, no. 4

[12] Antsiferov E. G., Aschepkov L. T., Bulatov V. P., Metody optimizatsii i ikh prilozheniya. Ch. 1. Matematicheskoe programmirovanie, Nauka, Novosibirsk, 1990 | MR | Zbl

[13] Gamm A. Z., “Optimizatsiya rezhimov energoob'edinenii v novykh ekonomicheskikh usloviyakh”, Elektrichestvo, 1993, no. 11, 1–8

[14] Gamm A. Z., “Kompromissnoe upravlenie khozyaistvenno-nezavisimymi elektroenergeticheskimi sistemami”, Izv. RAN. Energetika, 1993, no. 11, 46–57

[15] Gamm A. Z., Tairova E. V., Khamisov O. V., Pareto-optimalnye i chebyshevskie tochki v kompromissnom upravlenii elektroenergeticheskimi sistemami, ISEM SO RAN, Irkutsk, 1998

[16] Antsiferov E. G., Bulatov V. P., “Algoritm simpleksnykh pogruzhenii v vypuklom programmirovanii”, Zh. vychisl. matem. i matem. fiz., 27:3 (1987), 377–384 | MR | Zbl