Geodesic
The method of projective transformations for the minimization problem of a submodular function
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 9, pp. 1514-1524 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1998_38_9_a9,
     author = {N. N. Pisaruk and E. P. Sobolevskaya},
     title = {The method of projective transformations for the minimization problem of a submodular function},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1514--1524},
     year = {1998},
     volume = {38},
     number = {9},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_9_a9/}
}
TY  - JOUR
AU  - N. N. Pisaruk
AU  - E. P. Sobolevskaya
TI  - The method of projective transformations for the minimization problem of a submodular function
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1998
SP  - 1514
EP  - 1524
VL  - 38
IS  - 9
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_9_a9/
LA  - ru
ID  - ZVMMF_1998_38_9_a9
ER  - 
%0 Journal Article
%A N. N. Pisaruk
%A E. P. Sobolevskaya
%T The method of projective transformations for the minimization problem of a submodular function
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1998
%P 1514-1524
%V 38
%N 9
%U http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_9_a9/
%G ru
%F ZVMMF_1998_38_9_a9
N. N. Pisaruk; E. P. Sobolevskaya. The method of projective transformations for the minimization problem of a submodular function. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 9, pp. 1514-1524. http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_9_a9/

[1] Kovalev M. M., Matroidy v diskretnoi optimizatsii, Universitetskoe, Minsk, 1987

[2] Fujishige S., “Submodular functions and optimization”, Ann. Discrete Math., North-Holland, Amsterdam, 1991 | Zbl

[3] Edmonds J., “Submodular functions, matroids, and certain polyhedra”, Combinatorial Structures and their Appl., Gordon and Breach, New York, 1970, 69–87 | MR

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

[5] Skhreiver A., Teoriya lineinogo i tselochislennogo programmirovaniya, v. 1, Mir, M., 1991

[6] Yudin D. B., Nemirovskii A. S., “Informatsionnaya slozhnost i effektivnye metody resheniya vypuklykh ekstremalnykh zadach”, Ekonomika i matem. metody, 12:2 (1976), 357–369 | MR | Zbl

[7] Nesterov Yu. E., Effektivnye metody v nelineinom programmirovanii, Radio i svyaz, M., 1989

[8] Tarasov S. V., Khaniyan L. G., Erlikh I. I., “Metod vpisannykh ellipsoidov”, Dokl. AN SSSR, 298:5 (1988), 1081–1085 | Zbl

[9] Sonneved G., “New algorithm in convex programming based on a notion of “centre” (for system of analytic inequalities) and on rational extrapolation”, Trends Math. Optimizat., Birkhäuser, Basel, 1988, 311–326

[10] Vaidya P. M., “A new algorithm for minimizing convex functions over convex sets”, Proc. 30th Ann. IEEE Simp. Foundations of Computer Sci., IEEE Computer Soc. Press, Los Alamitos, CA, 1989, 338–343