Two methods for minimizing convex functions in a class of nonconvex sets
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 48 (2008) no. 10, pp. 1802-1811
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
The conditional gradient method and the steepest descent method, which are conventionally used for solving convex programming problems, are extended to the case where the feasible set is the set-theoretic difference between a convex set and the union of several convex sets. Iterative algorithms are proposed, and their convergence is examined.
[1] Demyanov V. F., Vasilev L. V., Nedifferentsiruemaya optimizatsiya, Nauka, M., 1981 | MR
[2] Chernyaev Yu. A., “Obobschenie metoda uslovnogo gradienta na odin klass nevypuklykh ekstremalnykh zadach”, Zh. vychisl. matem. i matem. fiz., 46:4 (2006), 576–582 | MR | Zbl
[3] Vasilev F. P., Chislennye metody resheniya ekstremalnykh zadach, Nauka, M., 1980 | MR
[4] Loran P. Zh., Approksimatsiya i optimizatsiya, Mir, M., 1975