@article{ZVMMF_1992_32_4_a1,
author = {V. N. Nef\"edov},
title = {Some problems of solving {Lipschitzian} global optimization problems using the branch and bound method},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {512--529},
year = {1992},
volume = {32},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_4_a1/}
}
TY - JOUR AU - V. N. Nefëdov TI - Some problems of solving Lipschitzian global optimization problems using the branch and bound method JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 1992 SP - 512 EP - 529 VL - 32 IS - 4 UR - http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_4_a1/ LA - ru ID - ZVMMF_1992_32_4_a1 ER -
%0 Journal Article %A V. N. Nefëdov %T Some problems of solving Lipschitzian global optimization problems using the branch and bound method %J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki %D 1992 %P 512-529 %V 32 %N 4 %U http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_4_a1/ %G ru %F ZVMMF_1992_32_4_a1
V. N. Nefëdov. Some problems of solving Lipschitzian global optimization problems using the branch and bound method. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 32 (1992) no. 4, pp. 512-529. http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_4_a1/
[1] Leonov V. V., “Metod pokrytii dlya otyskaniya globalnogo maksimuma funktsii ot mnogikh peremennykh”, Issl. po kibernetike, Sov. radio, M., 1970, 41–52 | MR
[2] Evtushenko Yu. G., “Chislennyi metod poiska globalnogo ekstremuma funktsii (perebor na neravnomernoi setke)”, Zh. vychisl. matem. i matem. fiz., 11:6 (1971), 1390–1403 | Zbl
[3] Ivanov V. V., “Ob optimalnykh algoritmakh minimizatsii funktsii nekotorykh klassov”, Kibernetika, 1972, no. 4, 81–94 | Zbl
[4] Sukharev A. G., Optimalnyi poisk ekstremuma, Izd-vo MGU, M., 1975
[5] Potapov M. A., Metody neravnomernykh pokrytii i ikh primenenie dlya resheniya zadach globalnoi optimizatsii v dialogovom rezhime, Dis. ...kand. fiz.-matem. nauk, VTs AN SSSR, M., 1984
[6] Nefedov V. N., Ob odnom metode globalnoi maksimizatsii funktsii neskolkikh peremennykh na parallelepipede, Dep. v VINITI 14.01.85, No 377-85 DEP.
[7] Nefedov V. N., Ob odnom chislennom metode otyskaniya globalnogo ekstremuma funktsii na mnozhestve, zadannom ogranicheniyami tipa neravenstv, Dep. v VINITI 10.07.85, No 4971-85 DEP.
[8] Pinter J., “Extended univariate algorithms for $n$-dimensional global optimization”, Computing, 36 (1986), 91–103 | DOI | MR | Zbl
[9] Pinter J., “Globally convergent methods for $n$-dimensional multiextremal optimization”, Optimization, 17 (1986), 187–202 | DOI | MR | Zbl
[10] Pinter J., Branch-and-Bound algorithm for solving multiextremal mathematical programming problems with Lipschitzian structure, Working Paper, VITUKI, Budapest, 1987
[11] Nefedov V. N., “Otyskanie globalnogo maksimuma funktsii neskolkikh peremennykh na mnozhestve, zadannom ogranicheniyami tipa neravenstv”, Zh. vychisl. matem. i matem. fiz., 27:1 (1987), 35–51 | MR | Zbl
[12] Horst R., “Deterministic global optimization with partition sets whose feasibility is not known. Application to concave minimization, DC-programming, reverse convex constraints and Lipschitzian optimization”, J. Optimizat. Theory and Applic., 58:1 (1988), 11–37 | DOI | MR | Zbl
[13] Horst R., “Deterministic methods in constrained global optimization: Some recent advances and new-fields of application”, Nav. Res. Logistics, 37 (1990), 433–471 | 3.0.CO;2-2 class='badge bg-secondary rounded-pill ref-badge extid-badge'>DOI | MR | Zbl
[14] Strongin P. G., “Ob odnom algoritme globalnoi minimizatsii”, Izv. vuzov. Radiofizika, 13:4 (1970), 539–545 | MR
[15] Strongin R. G., Markin D. L., “Minimizatsiya mnogoekstremalnykh funktsii pri nevypuklykh ogranicheniyakh”, Kibernetika, 1986, no. 4, 64–69 | MR | Zbl
[16] Fedorov V. V., Chislennye metody maksimina, Nauka, M., 1979 | MR
[17] Lyusternik L. A., Sobolev V. I., Kratkii kurs funktsionalnogo analiza, Vyssh. shkola, M., 1982 | MR | Zbl