On the several algorithms of immersion-severances for the problem of mathematical programming
The Bulletin of Irkutsk State University. Series Mathematics, Tome 4 (2011) no. 2, pp. 91-101
Cet article a éte moissonné depuis la source Math-Net.Ru
General procedure of conditional minimization of continuous functions using operation of partial immersion of feasible set is proposed. Its convergence is proved. Realizations of procedure, assuming the probability of parallel calculations are described.
Keywords:
nonlinear programming, algorithm, immersion, severance, parallel calculations.
Mots-clés : convergence
Mots-clés : convergence
@article{IIGUM_2011_4_2_a6,
author = {I. Ya. Zabotin},
title = {On the several algorithms of immersion-severances for the problem of mathematical programming},
journal = {The Bulletin of Irkutsk State University. Series Mathematics},
pages = {91--101},
year = {2011},
volume = {4},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IIGUM_2011_4_2_a6/}
}
TY - JOUR AU - I. Ya. Zabotin TI - On the several algorithms of immersion-severances for the problem of mathematical programming JO - The Bulletin of Irkutsk State University. Series Mathematics PY - 2011 SP - 91 EP - 101 VL - 4 IS - 2 UR - http://geodesic.mathdoc.fr/item/IIGUM_2011_4_2_a6/ LA - ru ID - IIGUM_2011_4_2_a6 ER -
%0 Journal Article %A I. Ya. Zabotin %T On the several algorithms of immersion-severances for the problem of mathematical programming %J The Bulletin of Irkutsk State University. Series Mathematics %D 2011 %P 91-101 %V 4 %N 2 %U http://geodesic.mathdoc.fr/item/IIGUM_2011_4_2_a6/ %G ru %F IIGUM_2011_4_2_a6
I. Ya. Zabotin. On the several algorithms of immersion-severances for the problem of mathematical programming. The Bulletin of Irkutsk State University. Series Mathematics, Tome 4 (2011) no. 2, pp. 91-101. http://geodesic.mathdoc.fr/item/IIGUM_2011_4_2_a6/
[1] V. P. Bulatov, Metody pogruzheniya v zadachakh optimizatsii, Nauka, Novosibirsk, 1977, 158 pp. | MR | Zbl
[2] F. P. Vasilev, Chislennye metody resheniya ekstremalnykh zadach, Nauka, M., 1988, 552 pp. | MR
[3] I. Ya. Zabotin, “Odna obschaya skhema resheniya zadachi matematicheskogo programmirovaniya i ee ispolzovanie v algoritmakh minimizatsii psevdovypuklykh funktsii”, Setochnye metody dlya kraevykh zadach i prilozheniya, Materialy Shestogo vseros. seminara, Kazan. gos. un-t, Kazan, 2005, 83–86
[4] I. Ya. Zabotin, “Relaksatsionnye algoritmy uslovnoi minimizatsii negladkikh strogo psevdovypuklykh funktsii”, Izv. vuzov. Matematika, 2003, no. 12, 62–70 | MR | Zbl