Geodesic
Substantiation of interior point algorithms
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 2, pp. 208-221 
V. I. Zorkal'tsev. Substantiation of interior point algorithms. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 2, pp. 208-221. http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_2_a6/
@article{ZVMMF_1999_39_2_a6,
     author = {V. I. Zorkal'tsev},
     title = {Substantiation of interior point algorithms},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {208--221},
     year = {1999},
     volume = {39},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_2_a6/}
}
TY  - JOUR
AU  - V. I. Zorkal'tsev
TI  - Substantiation of interior point algorithms
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1999
SP  - 208
EP  - 221
VL  - 39
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_2_a6/
LA  - ru
ID  - ZVMMF_1999_39_2_a6
ER  - 
%0 Journal Article
%A V. I. Zorkal'tsev
%T Substantiation of interior point algorithms
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1999
%P 208-221
%V 39
%N 2
%U http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_2_a6/
%G ru
%F ZVMMF_1999_39_2_a6

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

[1] Zorkaltsev V. I., “Iterativnyi algoritm i programma resheniya zadachi lineinogo programmirovaniya”, Algoritmy i programmy resheniya zadach lineinoi algebry i matem. programmirovaniya, SEI SO AN SSSR, Irkutsk, 1979, 77–89

[2] Dikin I. I., Zorkaltsev V. I., Iterativnoe reshenie zadach matematicheskogo programmirovaniya (algoritmy metoda vnutrennikh tochek), Nauka, Novosibirsk, 1980 | MR | Zbl

[3] Dikin I. I., “Iterativnoe reshenie zadach lineinogo i kvadratichnogo programmirovaniya”, Dokl. AN SSSR, 174:4 (1967), 674–675 | MR | Zbl

[4] Barnes E. R., “A variation on Karmarkar's algorithm for solving linear problems”, Math. Program., 36 (1986), 174–182 | DOI | MR | Zbl

[5] Vanderley R. J., Mecheton M. S., Freedman B. A., “A modification of Karmarkar's linear programming algorithm”, Algorithmic, 1 (1986), 395–407 | DOI | MR

[6] Karmarkar N., “A new polynomial-time algorithm for linear programming”, Combinatorica, 4 (1984), 373–395 | DOI | MR | Zbl

[7] Evtushenko Yu. T., Zhadan V. T., “Relaksatsionnyi metod resheniya zadach nelineinogo programmirovaniya”, Zh. vychisl. matem. i matem. fiz., 17:4 (1977), 890–904 | MR | Zbl

[8] Adler I., Resende M., Veiga G., Karmarkar N., “An implementation of Karmarkar's algorithm for linear programming”, Math. Program., 44 (1989), 297–335 | DOI | MR | Zbl

[9] Zorkaltsev V. I., Otnositelno vnutrennyaya tochka optimalnykh reshenii, Komi fil. AN SSSR, Syktyvkar, 1984

[10] Zorkaltsev V. I., Metod otnositelno vnutrennikh tochek, Komi fil. AN SSSR, Syktyvkar, 1986

[11] Dikin I. I., “O skhodimosti odnogo iteratsionnogo protsessa”, Upravlyaemye sistemy, 12, IM SO AN SSSR, Novosibirsk, 1974, 54–60 | MR

[12] Zorkaltsev V. I., “Obosnovanie odnogo klassa proektivnykh algoritmov”, Tr. VTs SO RAN. Sistemnoe modelirovanie, 3(21), Izd-vo SO RAN, Novosibirsk, 1995, 55–72

[13] Zorkaltsev V. I., Obosnovanie semeistva proektivnykh algoritmov (protsessy vvoda v oblast dopustimykh reshenii i optimizatsii v dopustimoi oblasti), SEI SO RAN, Irkutsk, 1995

[14] Zorkaltsev V. I., Obosnovanie semeistva proektivnykh algoritmov (protsessy, sovmeschayuschie vvod v oblast dopustimykh reshenii s optimizatsiei), SEI SO RAN, Irkutsk, 1995