Título: Dual characterizations of set containments with strict convex inequalities
Autores: Goberna Torrent, Miguel Ángel
Jeyakumar, Vaithilingam
Dinh, Nguyen
Fecha: 2008-10-20
2008-10-20
2006-01
Publicador: RUA Docencia
Fuente:
Tipo: info:eu-repo/semantics/article
Tema: Set containment
Convex functions
Semi-infinite systems
Existence theoremes
Dual cones
Conjugacy
Matemáticas
Descripción: 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.
MCYT of Spain and FEDER of UE, Grant BMF2002-04114-CO201.
Idioma: Inglés

Artículos similares:

Choosing the correct paradigm for unknown words in rule-based machine translation systems por Sánchez Cartagena, Víctor Manuel,Esplà Gomis, Miquel,Sánchez Martínez, Felipe,Pérez Ortiz, Juan Antonio
Using external sources of bilingual information for on-the-fly word alignment por Esplà Gomis, Miquel,Sánchez Martínez, Felipe,Forcada Zubizarreta, Mikel L.
10