Geodesic
The complexity of the computation of a global minimum in certain classes of optimization problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 10, pp. 1480-1498 
V. N. Nefëdov. The complexity of the computation of a global minimum in certain classes of optimization problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 10, pp. 1480-1498. http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_10_a3/
@article{ZVMMF_1993_33_10_a3,
     author = {V. N. Nef\"edov},
     title = {The complexity of the computation of a global minimum in certain classes of optimization problems},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1480--1498},
     year = {1993},
     volume = {33},
     number = {10},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_10_a3/}
}
TY  - JOUR
AU  - V. N. Nefëdov
TI  - The complexity of the computation of a global minimum in certain classes of optimization problems
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1993
SP  - 1480
EP  - 1498
VL  - 33
IS  - 10
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_10_a3/
LA  - ru
ID  - ZVMMF_1993_33_10_a3
ER  - 
%0 Journal Article
%A V. N. Nefëdov
%T The complexity of the computation of a global minimum in certain classes of optimization problems
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1993
%P 1480-1498
%V 33
%N 10
%U http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_10_a3/
%G ru
%F ZVMMF_1993_33_10_a3

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

[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-35 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”, Optimizat., 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. H., “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 set 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] Nefedov V. N., “Nekotorye voprosy resheniya lipshitsevykh zadach globalnoi optimizatsii s ispolzovaniem metoda vetvei i granits”, Zh. vychisl. matem. i matem. fiz., 32:4 (1992), 512–529 | MR | Zbl

[15] Perevozchikov A. G., “O slozhnosti vychisleniya globalnogo ekstremuma v odnom klasse mnogoekstremalnykh zadach”, Zh. vychisl. matem. i matem. fiz., 30:3 (1990), 379–387 | MR

[16] Kofman A., Vvedenie v prikladnuyu kombinatoriku, Mir, M., 1975

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

[18] Nefedov V. N., Ob odnom dostatochnom uslovii ekstremuma dlya polinomov i stepennykh ryadov, Dep. v VINITI 16.05.90, No 2666-V90