Separation of convex sets by Clarke subdifferential

GAUDIOSO, MANLIO;GORGONE, ENRICO;
2010-01-01

Abstract

In this article we consider a separation technique proposed in J. Grzybowski, D. Pallaschke, and R. Urbanski (A pre-classification and the separation law for closed bounded convex sets, Optim. Method Softw. 20(2005), pp. 219-229) for separating two convex sets A and B with another convex set C. We prove that in a finite dimension C can be chosen as the Clarke subdifferential at the origin of minfpA,pBg, where pA, pB denotes the support functions of A and B respectively. © 2010 Taylor & Francis.
2010
Convex analysis; Data classification; Non-smooth optimization; Applied Mathematics; Control and Optimization; Management Science and Operations Research
Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Questionnaire and social

Share on:
Impostazioni cookie