Geodesic
Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 56 (2016) no. 3, pp. 387-393 
Yu. A. Chernyaev. Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 56 (2016) no. 3, pp. 387-393. http://geodesic.mathdoc.fr/item/ZVMMF_2016_56_3_a5/
@article{ZVMMF_2016_56_3_a5,
     author = {Yu. A. Chernyaev},
     title = {Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {387--393},
     year = {2016},
     volume = {56},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2016_56_3_a5/}
}
TY  - JOUR
AU  - Yu. A. Chernyaev
TI  - Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2016
SP  - 387
EP  - 393
VL  - 56
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2016_56_3_a5/
LA  - ru
ID  - ZVMMF_2016_56_3_a5
ER  - 
%0 Journal Article
%A Yu. A. Chernyaev
%T Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2016
%P 387-393
%V 56
%N 3
%U http://geodesic.mathdoc.fr/item/ZVMMF_2016_56_3_a5/
%G ru
%F ZVMMF_2016_56_3_a5

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

A numerical algorithm for minimizing a convex function on a smooth surface is proposed. The algorithm is based on reducing the original problem to a sequence of convex programming problems. Necessary extremum conditions are examined, and the convergence of the algorithm is analyzed.

[1] Minnibaev T. F., Chernyaev Yu. A., “Iteratsionnyi algoritm resheniya zadachi matematicheskogo programmirovaniya s predvypuklymi ogranicheniyami”, Zh. vychisl. matem. i matem. fiz., 50:5 (2010), 832–835 | MR | Zbl

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

[3] Dulliev A. M., Zabotin V. I., “Iteratsionnyi algoritm proektirovaniya tochki na nevypukloe mnogoobrazie v lineinom normirovannom prostranstve”, Zh. vychisl. matem. i matem. fiz., 44:5 (2004), 827–830 | MR | Zbl

[4] Zabotin V. I., Arutyunova N. K., “Dva algoritma otyskaniya proektsii tochki na nevypukloe mnozhestvo v normirovannom prostranstve”, Zh. vychisl. matem. i matem. fiz., 53:3 (2013), 344–349 | DOI | MR | Zbl

[5] Arutyunova N. K., Dulliev A. M., Zabotin V. I., “Algoritmy proektirovaniya tochki na poverkhnost urovnya nepreryvnoi na kompakte funktsii”, Zh. vychisl. matem. i matem. fiz., 54:9 (2014), 1448–1454 | DOI | Zbl

[6] Demyanov V. F., Vasilev L. V., Nedifferentsiruemaya optimizatsiya, Nauka, M., 1981 | MR