@article{ZVMMF_1997_37_8_a2,
author = {G. Yu. Grechka},
title = {Modified procedures of iterative prox-regularization},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {914--924},
year = {1997},
volume = {37},
number = {8},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_8_a2/}
}
G. Yu. Grechka. Modified procedures of iterative prox-regularization. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 37 (1997) no. 8, pp. 914-924. http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_8_a2/
[1] Pshenichnyi B. N., Metod linearizatsii, Nauka, M., 1983 | MR
[2] Antipin A. S., Metody nelineinogo programmirovaniya, osnovannye na pryamoi i dvoistvennoi modifikatsii funktsii Lagranzha, Preprint, VNII sistemnykh issledovanii, M., 1979
[3] Rockafellar R. T., “Augmented Lagrangians and applications of the proximal point algorithm in convex programming”, Math. Operat. Res., 1:2 (1976), 97–116 | DOI | MR | Zbl
[4] Kaplan A. A., “Ob ustoichivosti metodov resheniya zadach vypuklogo programmirovaniya i variatsionnykh neravenstv”, Modeli i metody optimizatsii, 10, In-t matem. SO AN SSSR, Novosibirsk, 1988, 132–159 | Zbl
[5] Kaplan A. A., “Iteratsionnye protsessy vypuklogo programmirovaniya s vnutrennei regulyarizatsiei”, Sibirskii matem. zhurnal, 20:2 (1979), 307–316 | MR | Zbl
[6] Vasilev F. P., Obradovich O., “Regulyarizovannyi proksimalnyi metod dlya zadach minimizatsii s netochnymi iskhodnymi dannymi”, Zh. vychisl. matem. i matem. fiz., 33:2 (1993), 179–188 | MR
[7] Kaplan A. A., Tikhachke R., Variatsionnye neravenstva i polubeskonechnye zadachi vypukloi optimizatsii, Preprint, In-t matem. SO AN SSSR, Novosibirsk, 1989
[8] Grossman K., Kaplan A. A., Nelineinoe programmirovanie na osnove bezuslovnoi minimizatsii, Nauka, Novosibirsk, 1981 | Zbl
[9] Gryazina G. Yu., Algoritmy s vnutrennei proks-regulyarizatsiei, osnovannye na metode shtrafov, Preprint, In-t matem. SO RAN, Novosibirsk, 1993