Geodesic
Efficient methods for solving convex programming problems that apply embedding of admissible set in simplexes
Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 3, pp. 3-10.

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

A variant of the embedding method is proposed. In previous proposed variants the support cones played the role of embedding sets. Here the cones are replaced with support simplexes which enables one to obtain a polynomial guaranteed convergence rate and its best mean estimate. Tabl. 1, illustr. 2, bibl. 5.
Keywords: convex cone, support cone, Chebyshev point, support simplex. 
@article{DA_2008_15_3_a0,
     author = {V. P. Bulatov and T. I. Belykh and \`E. N. Yas'kova},
     title = {Efficient methods for solving convex programming problems that apply embedding of admissible set in simplexes},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--10},
     publisher = {mathdoc},
     volume = {15},
     number = {3},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2008_15_3_a0/}
}
TY  - JOUR
AU  - V. P. Bulatov
AU  - T. I. Belykh
AU  - È. N. Yas'kova
TI  - Efficient methods for solving convex programming problems that apply embedding of admissible set in simplexes
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2008
SP  - 3
EP  - 10
VL  - 15
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2008_15_3_a0/
LA  - ru
ID  - DA_2008_15_3_a0
ER  - 
%0 Journal Article
%A V. P. Bulatov
%A T. I. Belykh
%A È. N. Yas'kova
%T Efficient methods for solving convex programming problems that apply embedding of admissible set in simplexes
%J Diskretnyj analiz i issledovanie operacij
%D 2008
%P 3-10
%V 15
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2008_15_3_a0/
%G ru
%F DA_2008_15_3_a0
V. P. Bulatov; T. I. Belykh; È. N. Yas'kova. Efficient methods for solving convex programming problems that apply embedding of admissible set in simplexes. Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 3, pp. 3-10. http://geodesic.mathdoc.fr/item/DA_2008_15_3_a0/

[1] Antsiferov E. G., Bulatov V. P., “Algoritm simpleksnykh pogruzhenii v vypuklom programmirovanii”, Zhurn. vychisl. matematiki i mat. fiziki, 27:3 (1984), 348–385 | MR

[2] Aschepkov L. T., Belov B. I., Bulatov V. P., Metody resheniya zadach matematicheskogo programmirovaniya i optimalnogo upravleniya, Nauka, Novosibirsk, 1984, 233 pp. | MR

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

[4] Bulatov V. P., Shepotko I. O., “Metod ortogonalnykh simpleksov v vypuklom programmirovanii”, Prikladnaya matematika, SEI SO AN SSSR, Irkutsk, 1982, 8–16

[5] Khachiyan L. G., “Polinomialnye algoritmy v lineinom programmirovanii”, Zhurn. vychisl. matematiki i mat. fiziki, 28:1 (1980), 51–69 | MR