Geodesic
A Cutting-Plane Method with Updating of Approximating Sets and Estimates of the Solution Accuracy
Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, Tome 155 (2013) no. 2, pp. 54-64 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

We propose a cutting-plane method for solving a mathematical programming problem. A sequence of approximations is constructed using the technique of partial immersion of the admissible set in the approximating polyhedral sets. The developed method does not require the inclusion of each of the approximating sets in the previous one. This peculiarity makes it possible to periodically drop any additional planes which occur in the problem-solving process. We describe the features of the method, prove its convergence, and obtain estimates of the solution accuracy.
Keywords: approximating set, cutting plane, estimates of solution accuracy, sequence of approximations, conditional minimization.
Mots-clés : convergence 
@article{UZKU_2013_155_2_a4,
     author = {I. Ya. Zabotin and R. S. Yarullin},
     title = {A {Cutting-Plane} {Method} with {Updating} of {Approximating} {Sets} and {Estimates} of the {Solution} {Accuracy}},
     journal = {U\v{c}\"enye zapiski Kazanskogo universiteta. Seri\^a Fiziko-matemati\v{c}eskie nauki},
     pages = {54--64},
     year = {2013},
     volume = {155},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/UZKU_2013_155_2_a4/}
}
TY  - JOUR
AU  - I. Ya. Zabotin
AU  - R. S. Yarullin
TI  - A Cutting-Plane Method with Updating of Approximating Sets and Estimates of the Solution Accuracy
JO  - Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki
PY  - 2013
SP  - 54
EP  - 64
VL  - 155
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/UZKU_2013_155_2_a4/
LA  - ru
ID  - UZKU_2013_155_2_a4
ER  - 
%0 Journal Article
%A I. Ya. Zabotin
%A R. S. Yarullin
%T A Cutting-Plane Method with Updating of Approximating Sets and Estimates of the Solution Accuracy
%J Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki
%D 2013
%P 54-64
%V 155
%N 2
%U http://geodesic.mathdoc.fr/item/UZKU_2013_155_2_a4/
%G ru
%F UZKU_2013_155_2_a4
I. Ya. Zabotin; R. S. Yarullin. A Cutting-Plane Method with Updating of Approximating Sets and Estimates of the Solution Accuracy. Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, Tome 155 (2013) no. 2, pp. 54-64. http://geodesic.mathdoc.fr/item/UZKU_2013_155_2_a4/

[1] Bulatov V. P., Metody pogruzheniya v zadachakh optimizatsii, Nauka, Novosibirsk, 1977, 161 pp.

[2] Zabotin I. Ya., “O nekotorykh algoritmakh pogruzhenii-otsechenii dlya zadachi matematicheskogo programmirovaniya”, Izv. Irkutsk. gos. un-ta. Ser. «Matematika», 4:2 (2011), 91–101

[3] Zangvill U. I., Nelineinoe programmirovanie, Sov. radio, M., 1973, 312 pp.

[4] Levitin E. S., Polyak B. T., “Metody minimizatsii pri nalichii ogranichenii”, Zhurn. vychisl. matem. i matem. fiziki, 6:5 (1966), 787–823 | Zbl

[5] Zabotin I. Ya., Yarullin R. S., “Ob odnom podkhode k postroeniyu algoritmov otsechenii s otbrasyvaniem otsekayuschikh ploskostei”, Izv. vuzov. Matem., 2013, no. 3, 74–79 | Zbl

[6] Vasilev F. P., Chislennye metody resheniya ekstremalnykh zadach, Nauka, M., 1988, 552 pp.

[7] Zabotin Ya. I., Fukin I. A., “Ob odnoi modifikatsii metoda sdviga shtrafov dlya zadach nelineinogo programmirovaniya”, Izv. vuzov. Matem., 2000, no. 12, 49–54

[8] Pshenichnyi B. N., Vypuklyi analiz i ekstremalnye zadachi, Nauka, M., 1980, 319 pp.