Abstract:
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.
Key words:preconvex set, convex programming problem, necessary condition for a local minimum, convergence of an iterative algorithm.
Fulltext:
PDF file (177 kB)