Generalization of Newton's method to the class of nonconvex mathematical programming problems
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (2008), pp. 78-82
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{IVM_2008_1_a7,
author = {Yu. A. Chernyaev},
title = {Generalization of {Newton's} method to the class of nonconvex mathematical programming problems},
journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
pages = {78--82},
year = {2008},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IVM_2008_1_a7/}
}
Yu. A. Chernyaev. Generalization of Newton's method to the class of nonconvex mathematical programming problems. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (2008), pp. 78-82. http://geodesic.mathdoc.fr/item/IVM_2008_1_a7/
[1] Chernyaev Yu. A., “Skhodimost metoda proektsii gradienta dlya odnogo klassa nevypuklykh zadach matematicheskogo programmirovaniya”, Izv. vuzov. Matematika, 2005, no. 12, 76–79 | MR
[2] Chernyaev Yu. A., “Obobschenie metoda uslovnogo gradienta na odin klass nevypuklykh ekstremalnykh zadach”, Zhurn. vychisl. matem. i matem. fiz., 46:4 (2006), 576–582 | MR | Zbl
[3] Vasilev F. P., Chislennye metody resheniya ekstremalnykh zadach, Nauka, M., 1980, 520 pp.