Geodesic
The parallel variant of conditional optimization algorithm with Box complex method
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 12 (2012) no. 3, pp. 109-117.

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

This article presents the results of the adaptation algorithm for global extremum searching with presence explicit and implicit constraints complex method created by Box for systems of the distributed and parallel computing. The optimal count of nodes of computing system from the point of view of reliability a global extremum finding and time of its search is defined. At the same time, the run time was several times smaller than on one computer and reliability of searching the global extremum is much higher due to the simultaneous researching of the target function in several areas of the factor space. 
@article{ISU_2012_12_3_a16,
     author = {A. N. Savin},
     title = {The parallel variant of conditional optimization algorithm with {Box} complex method},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {109--117},
     publisher = {mathdoc},
     volume = {12},
     number = {3},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2012_12_3_a16/}
}
TY  - JOUR
AU  - A. N. Savin
TI  - The parallel variant of conditional optimization algorithm with Box complex method
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2012
SP  - 109
EP  - 117
VL  - 12
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ISU_2012_12_3_a16/
LA  - ru
ID  - ISU_2012_12_3_a16
ER  - 
%0 Journal Article
%A A. N. Savin
%T The parallel variant of conditional optimization algorithm with Box complex method
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2012
%P 109-117
%V 12
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ISU_2012_12_3_a16/
%G ru
%F ISU_2012_12_3_a16
A. N. Savin. The parallel variant of conditional optimization algorithm with Box complex method. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 12 (2012) no. 3, pp. 109-117. http://geodesic.mathdoc.fr/item/ISU_2012_12_3_a16/

[1] Batura M. P., Modelirovanie i optimizatsiya moschnykh priborov SVCh, BGUIR, Minsk, 2006, 275 pp.

[2] Orlyanskaya I. V., “Sovremennye podkhody k postroeniyu metodov globalnoi optimizatsii”, Elektronnyi zhurnal “Issledovano v Rossii”, 5 (2002), 189, 2097–2108, (data obrascheniya 02.12.2011) URL: http://zhurnal.ape.relarn.ru/articles/2002/189.pdf

[3] Bandi B., Metody optimizatsii, Vvodnyi kurs, Radio i svyaz, M., 1988, 128 pp.

[4] Savin A. N., Sharaevskii Yu. P., Timofeeva N. E., “Modifikatsiya kompleksnogo metoda uslovnoi optimizatsii Boksa dlya opredeleniya razmerov zamedlyayuschikh sistem po zadannym elektrodinamicheskim kharakteristikam”, SVCh-tekhnika i telekommunikatsionnye tekhnologii, Materialy 15-i mezhdunar. Krymskoi konf. (KryMiKo2005), Veber, Sevastopol, Ukraina, 2005, 779–780

[5] Kalitkin N. N., Chislennye metody, Nauka, M., 1978, 512 pp. | MR

[6] GigaSpaces eXtreme Application Platform (XAP), URL: , (data obrascheniya 02.12.2011) http://www.gigaspaces.com/xap