Geodesic
One approach to constructing cutting algorithms with dropping of cutting planes
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 3 (2013), pp. 74-79.

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

We propose a general cutting method for conditional minimization of continuous functions. We calculate iteration points by partially immersing the admissible set in approximating polyhedral sets. We describe the features of the proposed method and prove its convergence. The constructed general method does not imply the inclusion of each of approximating sets in the previous one. This feature allows us to construct cutting algorithms which periodically drop any additional restrictions which occur in the solution process.
Keywords: conditional minimization, approximating set, cutting plane, algorithm, sequence of approximations
Mots-clés : convergence. 
@article{IVM_2013_3_a8,
     author = {I. Ya. Zabotin and R. S. Yarullin},
     title = {One approach to constructing cutting algorithms with dropping of cutting planes},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {74--79},
     publisher = {mathdoc},
     number = {3},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2013_3_a8/}
}
TY  - JOUR
AU  - I. Ya. Zabotin
AU  - R. S. Yarullin
TI  - One approach to constructing cutting algorithms with dropping of cutting planes
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2013
SP  - 74
EP  - 79
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2013_3_a8/
LA  - ru
ID  - IVM_2013_3_a8
ER  - 
%0 Journal Article
%A I. Ya. Zabotin
%A R. S. Yarullin
%T One approach to constructing cutting algorithms with dropping of cutting planes
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2013
%P 74-79
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2013_3_a8/
%G ru
%F IVM_2013_3_a8
I. Ya. Zabotin; R. S. Yarullin. One approach to constructing cutting algorithms with dropping of cutting planes. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 3 (2013), pp. 74-79. http://geodesic.mathdoc.fr/item/IVM_2013_3_a8/

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

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

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

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

[5] Vasilev F. P., Chislennye metody resheniya ekstremalnykh zadach, Nauka, M., 1988 | MR