Iterative algorithm for mathematical programming problems with preconvex constraints
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 50 (2010) no. 5, pp. 832-835
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
An iterative algorithm is proposed for minimizing a convex function on a set defined as the set-theoretic difference between a convex set and the union of several convex sets. The convergence of the algorithm is proved in terms of necessary conditions for a local minimum.
[1] Zabotin V. I., Polonskii Yu. A., “Predvypuklye mnozhestva, otobrazheniya i ikh prilozheniya k ekstremalnym zadacham”, Kibernetika, 1981, no. 1, 71–74 | MR | Zbl
[2] Chernyaev Yu. A., “Dva metoda minimizatsii vypuklykh funktsii na klasse nevypuklykh mnozhestv”, Zh. vychisl. matem. i matem. fiz., 48:10 (2008), 1802–1811 | MR | Zbl