Geodesic
Method of orthogonal simplexes and its applications to convex programming
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 48 (2008) no. 4, pp. 610-622

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

Numerical methods for solving a convex programming problem are considered whose guaranteed convergence rate depends only on the space dimension. On average, the ratio of the corresponding geometric progression is better than that in the basis model of ellipsoids or simplexes. Results of numerical experiments are presented. 
@article{ZVMMF_2008_48_4_a5,
     author = {V. P. Bulatov},
     title = {Method of orthogonal simplexes and its applications to convex programming},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {610--622},
     publisher = {mathdoc},
     volume = {48},
     number = {4},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_4_a5/}
}
TY  - JOUR
AU  - V. P. Bulatov
TI  - Method of orthogonal simplexes and its applications to convex programming
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2008
SP  - 610
EP  - 622
VL  - 48
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_4_a5/
LA  - ru
ID  - ZVMMF_2008_48_4_a5
ER  - 
%0 Journal Article
%A V. P. Bulatov
%T Method of orthogonal simplexes and its applications to convex programming
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2008
%P 610-622
%V 48
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_4_a5/
%G ru
%F ZVMMF_2008_48_4_a5
V. P. Bulatov. Method of orthogonal simplexes and its applications to convex programming. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 48 (2008) no. 4, pp. 610-622. http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_4_a5/