Geodesic
On the coefficient of reduction of the complexity of some algorithms
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 6 (2003), pp. 50-63.

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

@article{IVM_2003_6_a6,
     author = {M. V. Pudova},
     title = {On the coefficient of reduction of the complexity of some algorithms},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {50--63},
     publisher = {mathdoc},
     number = {6},
     year = {2003},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2003_6_a6/}
}
TY  - JOUR
AU  - M. V. Pudova
TI  - On the coefficient of reduction of the complexity of some algorithms
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2003
SP  - 50
EP  - 63
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2003_6_a6/
LA  - ru
ID  - IVM_2003_6_a6
ER  - 
%0 Journal Article
%A M. V. Pudova
%T On the coefficient of reduction of the complexity of some algorithms
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2003
%P 50-63
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2003_6_a6/
%G ru
%F IVM_2003_6_a6
M. V. Pudova. On the coefficient of reduction of the complexity of some algorithms. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 6 (2003), pp. 50-63. http://geodesic.mathdoc.fr/item/IVM_2003_6_a6/

[1] Antsyz S. M., Pudova M. V., Metody vnutrennei tochki dlya resheniya zadach so spetsialnoi strukturoi, Preprint No 44, Izd-vo IM SO RAN, Novosibirsk, 1997, 27 pp.

[2] Pissanetski S., Tekhnologiya razrezhennykh matrits, Mir, M., 1988, 410 pp. | MR

[3] Dantsig Dzh., Lineinoe programmirovanie, ego primenenie i obobscheniya, Progress, M., 1966, 600 pp.

[4] Kornai I., Liptak T., “Planirovanie na dvukh urovnyakh”, Primenenie matematiki v ekonomicheskikh issledovaniyakh, T. 3, ed. V. Ts. Nemchinov, Mysl, M., 1965, 495 | MR

[5] Rubinshtein G. Sh., “O reshenii zadach lineinogo programmirovaniya bolshogo ob'ema”, Optimalnoe planirovanie, no. 2, Nauka, Novosibirsk, 1964, 3–22 | MR

[6] Zvyagina R. A., “Zadachi lineinogo programmirovaniya s blochno-diagonalnymi matritsami”, Optimalnoe planirovanie, no. 2, Nauka, Novosibirsk, 1964, 50–61

[7] Zvyagina R. A., “Ob obschem metode resheniya zadach lineinogo programmirovaniya blochnoi struktury”, Optimizatsiya, no. 1, Novosibirsk, 1971, 22–40

[8] Kantorovich L. V., Ekonomicheskii raschet nailuchshego ispolzovaniya resursov, Izd-vo AN SSSR, M., 1960, 348 pp. | MR

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

[10] Rinaldi G., “A projective method for linear programming with box-type constrains”, Algorithmica, 1986, no. 1, 517–527 | DOI | MR | Zbl

[11] Dikin I. I., “Iterativnoe reshenie zadach lineinogo i kvadratichnogo programmirovaniya”, DAN SSSR, 174 (1967), 747–748 | MR | Zbl

[12] Bernes E. K., “A variation on Karmarkar's algorithm for solving programming problems”, Math. Program., 36:2 (1986), 174–182 | DOI | MR

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

[14] Fujisawa K., Kojima M., Nakata K., “Exploiting sparsity in primal-dual interior-point methods for semidefinite programming”, Math. Program., 79 (1997), 235–255 | MR

[15] Todd M. J., “Exploiting special structure in Karmarkar's linear programming algorithm”, Math. Program., 41:1 (1988), 97–113 | DOI | MR | Zbl

[16] Choi I. C., Goldfarb D., “Exploiting special structure in a primal-dual path-following algorithm”, Math. Program., 58:2 (1993), 33–53 | DOI | MR