Abstract
Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. 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 idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Fenchel, W. (1952). A remark on convex sets and polarity, Communications du Séminaire Mathématique de l’Université de Lund Supplement, 82–89.
Fung G., Mangasarian O.L., Shavlik J., Knowledge-based support vector machine classifiers. In: Becker S., Thrun S., Obermayer K. (eds). Neural Information Processing Systems 15. MIT Press, Cambridge MA, pp. 521–528
M.A. Goberna V. Jornet M.M.L. Rodriguez (2002) ArticleTitleOn the characterization of some families of closed convex sets Contributions to Algebra and Geometry. 43 153–169
Goberna, M.A., Rodriguez, M.M.L. Linear systems containing strict inequalities via evenly convex hulls, European Journal of Operational Research (to appear).
M.A. Goberna M.A. Lopez (1998) Linear Semi-infinite Optimization Wiley Series in Mathematical Methods in Practice John Wiley & Sons Chichester
M.A. Goberna M. Larriqueta V. Vera de Serio (2003) ArticleTitleOn the stability of the boundary of the feasible set in linear optimization Set-Valued Analysis 11 203–223 Occurrence Handle10.1023/A:1022950908783
J.B. Hiriart-Urruty C. Lemarechal (1993) Convex Analysis and Minimization Algorithms Springer-Verlag Berlin, Heidelberg
V. Jeyakumar (2003) ArticleTitleCharacterizing set containments involving infinite convex constraints and reverse-convex constraints SIAM Journal of Optimization 13 947–959
Jeyakumar, V., (2001), Farkas’ lemma: generalizations. In: Encyclopedia of Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands, VII, pp. 87–91
Jeyakumar, V., Ormerod, J. and Womersley, R. Knowledge-based semidefinite linear programming classifiers, Optimization Methods and Software (to appear).
O.L. Mangasarian (1997) ArticleTitleMathematical programming in data mining Data Mining and Knowledge Discovery. 1 183–201 Occurrence Handle10.1023/A:1009735908398
O.L. Mangasarian (2002) ArticleTitleSet Containment characterization Journal of Global Optimization. 24 473–480 Occurrence Handle10.1023/A:1021207718605
O.L. Mangasarian (1994) Nonlinear Programming SIAM Philadelphia, PA
Y.J. Zhu (1966) ArticleTitleGeneralizations of some fundamental theorems on linear inequalities Acta Mathematicae Sinica. 16 25–39
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Goberna, M.A., Jeyakumar, V. & Dinh, N. Dual Characterizations of Set Containments with Strict Convex Inequalities. J Glob Optim 34, 33–54 (2006). https://doi.org/10.1007/s10898-005-3885-6
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10898-005-3885-6