Geodesic
Estimates for the accuracy of solutions of discrete convex optimization problems obtained by a coordinatewise lifting algorithm
Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 4, pp. 60-80.

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

@article{DA_2005_12_4_a4,
     author = {A. B. Ramazanov},
     title = {Estimates for the accuracy of solutions of discrete convex optimization problems obtained by a coordinatewise lifting algorithm},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {60--80},
     publisher = {mathdoc},
     volume = {12},
     number = {4},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2005_12_4_a4/}
}
TY  - JOUR
AU  - A. B. Ramazanov
TI  - Estimates for the accuracy of solutions of discrete convex optimization problems obtained by a coordinatewise lifting algorithm
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2005
SP  - 60
EP  - 80
VL  - 12
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2005_12_4_a4/
LA  - ru
ID  - DA_2005_12_4_a4
ER  - 
%0 Journal Article
%A A. B. Ramazanov
%T Estimates for the accuracy of solutions of discrete convex optimization problems obtained by a coordinatewise lifting algorithm
%J Diskretnyj analiz i issledovanie operacij
%D 2005
%P 60-80
%V 12
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2005_12_4_a4/
%G ru
%F DA_2005_12_4_a4
A. B. Ramazanov. Estimates for the accuracy of solutions of discrete convex optimization problems obtained by a coordinatewise lifting algorithm. Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 4, pp. 60-80. http://geodesic.mathdoc.fr/item/DA_2005_12_4_a4/

[1] Glebov N. I., “O primenimosti metoda pokoordinatnogo spuska k nekotorym zadacham vypuklogo tselochislennogo programmirovaniya”, Upravlyaemye sistemy. Sb. nauchn. tr., no. 17, In-t matematiki SO AN SSSR, Novosibirsk, 1978, 52–59 | MR

[2] Emelichev V. A., Ovchinnikov V. G., “K teorii optimizatsii na antitsepyakh, obladayuschikh svoistvom zameny Shteinitsa”, Kibernetika, 1985, no. 2, 55–58 | MR | Zbl

[3] Kovalev M. M., Matroidy v diskretnoi optimizatsii, Izd-vo Universitetskoe, Minsk, 1987 | MR | Zbl

[4] Kovalev M. M., “Issledovanie po matematicheskoi ekonomike v BGU”, Vestnik BGU. Ser. 1, 2001, no. 3, 44–52 | MR

[5] Lebedeva T. T., Sergienko I. V., Soltan V. P., “Ob usloviyakh sovpadeniya lokalnogo i globalnogo minimumov v zadachakh diskretnoi optimizatsii”, Dokl. AN SSSR, 283:2 (1985), 287–290 | MR | Zbl

[6] Ramazanov A. B., “O garantirovannoi otsenke tochnosti gradientnogo algoritma na peresecheniyakh dvukh supermatroidov”, Rossiiskaya konf. “Diskretnyi analiz i issledovanie operatsii”, Materialy konferentsii (Novosibirsk, 2004 g.), Izd-vo In-ta matematiki, Novosibirsk, 2004, 169

[7] Saati T., Tselochislennye metody optimizatsii i svyazannye s nimi ekstremalnye problemy, Mir, M., 1973 | MR

[8] Emelichev V. A., Kovalev M. M., Ramazanov A. B., “Errors of gradient extrema of a strictly convex function of discrete argument”, J. Discrete Math. and Appl., 2:2 (1992), 119–131 | MR

[9] Korte B., Hausmann D., “An analysis of the greedy heuristic for independence systems”, Annals of Discrete Math., 2 (1978), 65–74 | DOI | MR | Zbl

[10] Nemhauser G. L., Wolsey L. A., Fisher M. L., “An analysis of approximation for maximizing submodular set functions”, Math. Programming, 14:3 (1978), 265–294 | DOI | MR | Zbl