Geodesic
Primal-dual Newton method for linear programming problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 1, pp. 17-32

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

@article{ZVMMF_1999_39_1_a2,
     author = {V. G. Zhadan},
     title = {Primal-dual {Newton} method for linear programming problems},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {17--32},
     publisher = {mathdoc},
     volume = {39},
     number = {1},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_1_a2/}
}
TY  - JOUR
AU  - V. G. Zhadan
TI  - Primal-dual Newton method for linear programming problems
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1999
SP  - 17
EP  - 32
VL  - 39
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_1_a2/
LA  - ru
ID  - ZVMMF_1999_39_1_a2
ER  - 
%0 Journal Article
%A V. G. Zhadan
%T Primal-dual Newton method for linear programming problems
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1999
%P 17-32
%V 39
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_1_a2/
%G ru
%F ZVMMF_1999_39_1_a2
V. G. Zhadan. Primal-dual Newton method for linear programming problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 1, pp. 17-32. http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_1_a2/