Geodesic
The method of analytic barriers with updating for minimization of a convex function subject to box contraints on the variables
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 41 (2001) no. 1, pp. 9-16 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2001_41_1_a1,
     author = {V. A. Skokov},
     title = {The method of analytic barriers with updating for minimization of a convex function subject to box contraints on the variables},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {9--16},
     year = {2001},
     volume = {41},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_1_a1/}
}
TY  - JOUR
AU  - V. A. Skokov
TI  - The method of analytic barriers with updating for minimization of a convex function subject to box contraints on the variables
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2001
SP  - 9
EP  - 16
VL  - 41
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_1_a1/
LA  - ru
ID  - ZVMMF_2001_41_1_a1
ER  - 
%0 Journal Article
%A V. A. Skokov
%T The method of analytic barriers with updating for minimization of a convex function subject to box contraints on the variables
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2001
%P 9-16
%V 41
%N 1
%U http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_1_a1/
%G ru
%F ZVMMF_2001_41_1_a1
V. A. Skokov. The method of analytic barriers with updating for minimization of a convex function subject to box contraints on the variables. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 41 (2001) no. 1, pp. 9-16. http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_1_a1/

[1] Beer K., Skokov V. A., Cutting plane methods based on the analytic barrier for minimization of a convex function subject to box-constraints, Preprint 99-5, Techn. Univ., Chemnitz, 1999 | MR

[2] Nesterov Yu. E., “Complexity estimates of some cutting plane methods based on the analytic barrier”, Math. Program. Ser. B, 69:1 (1995), 1–28 | DOI | MR

[3] Levin A. Yu., “Ob odnom algoritme minimizatsii vypuklykh funktsii”, Dokl. AN SSSR, 160:6 (1965), 1244–1247 | MR | Zbl

[4] Shor N. Z., Metody minimizatsii nedifferentsiruemykh funktsii i ikh prilozheniya, Vischa shkola, Kiev, 1979 | MR

[5] Golshtein E. G., Nemirovskii A. S., Nesterov Yu. E., “Metod urovnei, ego obobscheniya i prilozheniya”, Ekonomika i matem. metody, 31:3 (1995), 164–180

[6] Skokov V. A., “Varianty metoda urovnei dlya minimizatsii negladkikh vypuklykh funktsii i ikh chislennoe issledovanie”, Ekonomika i matem. metody, 33:1 (1997), 129–138 | Zbl

[7] Kelley J. E., “The cutting-plane method for solving convex programs”, J. Soc. Industr. and Appl. Math., 8:4 (1960), 703–712 | DOI | MR

[8] Schramm H., Zowe J., “A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results”, SIAM J. Optimizat., 2:1 (1992), 121–152 | DOI | MR | Zbl

[9] Nesterov Yu. E., Skokov V. A., “Metody pervogo poryadka nelineinoi bezuslovnoi optimizatsii”, Chisl. metody matem. programmirovaniya, TsEMI AN SSSR, M., 1980, 6–60