An iterative method for minimizing a convex nonsmooth function on a convex smooth surface
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 4, pp. 611-615
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
An iterative algorithm is proposed for the constrained minimization of a convex nonsmooth function on a set given as a convex smooth surface. The convergence of the algorithm in the sense of necessary conditions for a local minimum is proved.
[1] Zabotin V. I., Chernyaev Yu. A., “Obobschenie metoda proektsii gradienta na ekstremalnye zadachi s predvypuklymi ogranicheniyami”, Zh. vychisl. matem. i matem. fiz., 41:3 (2001), 367–373 | MR | Zbl
[2] Zabotin V. I., Chernyaev Yu. A., “Skhodimost iteratsionnogo metoda resheniya zadachi matematicheskogo programmirovaniya s ogranicheniem v vide vypukloi gladkoi poverkhnosti”, Zh. vychisl. matem. i matem. fiz., 44:4 (2004), 609–612 | MR | Zbl
[3] Demyanov V. F., Vasilev L. V., Nedifferentsiruemaya optimizatsiya, Nauka, M., 1981 | MR
[4] Vasilev F. P., Chislennye metody resheniya ekstremalnykh zadach, Nauka, M., 1980 | MR