From linear to convex systems: consistency, Farkas' Lemma and applications

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10045/8805
Registro completo de metadatos
Registro completo de metadatos
Campo DCValorIdioma
dc.contributorProgramación Semi-infinitaen
dc.contributor.authorDinh, Nguyen-
dc.contributor.authorGoberna, Miguel A.-
dc.contributor.authorLópez Cerdá, Marco A.-
dc.contributor.otherUniversidad de Alicante. Departamento de Estadística e Investigación Operativaen
dc.contributor.otherHo Chi Minh City University of Pedagogy. Department of Mathematics-Informaticsen
dc.date.accessioned2008-12-09T08:34:07Z-
dc.date.available2008-12-09T08:34:07Z-
dc.date.created2005-
dc.date.issued2006-
dc.identifier.citationDINH, Nguyen; GOBERNA TORRENT, Miguel Ángel; LÓPEZ CERDÁ, Marco Antonio. “From linear to convex systems: consistency, Farkas' Lemma and applications”. Journal of Convex Analysis. Vol. 13, No. 1 (2006). ISSN 0944-6532, pp. 113-133en
dc.identifier.issn0944-6532-
dc.identifier.urihttp://hdl.handle.net/10045/8805-
dc.description.abstractThis paper analyzes inequality systems with an arbitrary number of proper lower semicontinuous convex constraint functions and a closed convex constraint subset of a locally convex topological vector space. More in detail, starting from well-known results on linear systems (with no constraint set), the paper reviews and completes previous works on the above class of convex systems, providing consistency theorems, two new versions of Farkas’ lemma, and optimality conditions in convex optimization. A new closed cone constraint qualification is proposed. Suitable counterparts of these results for cone-convex systems are also given.en
dc.description.sponsorshipThis research was partially supported by MCYT of Spain and FEDER of EU, Grant BMF2002-04114- C02-01.en
dc.languageengen
dc.publisherHeldermann Verlagen
dc.subjectConvex infinite programmingen
dc.subjectConstraint qualificationsen
dc.subject.otherMatemáticasen
dc.titleFrom linear to convex systems: consistency, Farkas' Lemma and applicationsen
dc.typeinfo:eu-repo/semantics/articleen
dc.peerreviewedsien
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccess-
Aparece en las colecciones:INV - LOPT - Artículos de Revistas

Archivos en este ítem:
Archivos en este ítem:
Archivo Descripción TamañoFormato 
ThumbnailDGL05JCA.pdfVersión revisada (acceso libre)192,66 kBAdobe PDFAbrir Vista previa
Thumbnailjca0534_b.pdfVersión final (acceso restringido)465,31 kBAdobe PDFAbrir    Solicitar una copia


Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.