On the degree and separability of nonconvexity and applications to optimization problems
- 115 Downloads
We study qualitative indications for d.c. representations of closed sets in and functions on Hilbert spaces. The first indication is an index of nonconvexity which can be regarded as a measure for the degree of nonconvexity. We show that a closed set is weakly closed if this indication is finite. Using this result we can prove the solvability of nonconvex minimization problems. By duality a minimization problem on a feasible set in which this indication is low, can be reduced to a quasi-concave minimization over a convex set in a low-dimensional space. The second indication is the separability which can be incorporated in solving dual problems. Both the index of nonconvexity and the separability can be characteristics to “good” d.c. representations. For practical computation we present a notion of clouds which enables us to obtain a good d.c. representation for a class of nonconvex sets. Using a generalized Caratheodory’s theorem we present various applications of clouds.
KeywordsGeneralized convexity Duality Optimization
Unable to display preview. Download preview PDF.
- J.B. Hiriart-Urruty. Generalized differentiability, duality and optimization for problems dealing with differences of convex functions. in: J. Ponstain, ed.,Lectures Notes in Economics and Mathematical Systems. Vol. 256 (Springer, New York, 1984) 37–70.Google Scholar
- A.D. Ioffe and V.M. Tikhomirov,Theory of External Problems (North-Holland, Amsterdam, 1979). (A translation from the Russian edition NAUKA, Moscow, 1974.)Google Scholar