Abstract
We give characterizations of the containment of a convex set either in an arbitrary convex set or in a set described by reverse cone-convex inequalities in Banach spaces. The convex sets under consideration are the solution sets of an arbitrary number of cone-convex inequalities, which can be either weak or strict inequalities. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems, where they are used to describe the containments as inequality constraints in optimization problems. The concept of evenly convex set is used to derive the dual conditions, characterizing the set containments.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Barbo, V., Precupanu, Th.: Convexity and Optimization in Banach Spaces. Academiei Republicii Socialiste Romania (1978)
Conway J.B.: A Course in Functional Analysis. Springer-Verlag, New York (1996)
Fenchel, W.: A remark on convex sets and polarity. Communications du Seminaire Mathematique de l’Universite de Lund (Suppl.), 82–89 (1952)
Fung, G., Managasarian, O.L., Shavlik, J.: Knowledge-based support vector machine classifiers. Neural Information Processing Systems 15 (NIPS 2002), vol. 15. MIT Press (2002)
Goberna M.A., Jeyakumar V., Dinh N.: Dual characterization of set containments with strict convex inequalities. J. Glob. Optim. 34, 33–54 (2006)
Goberna, M.A., Rodriguez, M.M.L.: Linear system containing inequalities via evenly convex hulls. Tech. Report, Dept. of Statistics and Oper. Res., University of Alicante. Eur. J. Oper. Res., to appear
Jeyakumar V.: Characterizing set containments involving infinite convex constraints and reverse-convex constraints. SIAM J. Optim. 13, 947–959 (2003)
Jeyakumar V., Lee G.M., Dinh N.: Chararcterizations of solution sets of convex vector minimization problems. Eur. J. Oper. Res. 174, 1380–1395 (2006)
Jeyakumar V., Zaffaroni A.: Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization. Numer. Funct. Anal. Optim. 17(4), 323–343 (1996)
Managasarian O.L.: Mathematical programming in data mining. Data Min. Knowl. Discov. 1, 183–201 (1997)
Managasarian O.L.: Set containment characterization. J. Glob. Optim. 24, 473–480 (2002)
Rudin, W.: Functional Analysis. McGraw-Hill, Inc. (1987)
Zalinescu C.: Convex Analysis in General Vector Spaces. World Scientific, London (2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Doagooei, A.R., Mohebi, H. Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces. J Glob Optim 43, 577–591 (2009). https://doi.org/10.1007/s10898-008-9337-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-008-9337-3