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
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor | Programación Semi-infinita | en |
dc.contributor.author | Dinh, Nguyen | - |
dc.contributor.author | Goberna, Miguel A. | - |
dc.contributor.author | López Cerdá, Marco A. | - |
dc.contributor.other | Universidad de Alicante. Departamento de Estadística e Investigación Operativa | en |
dc.contributor.other | Ho Chi Minh City University of Pedagogy. Department of Mathematics-Informatics | en |
dc.date.accessioned | 2008-12-09T08:34:07Z | - |
dc.date.available | 2008-12-09T08:34:07Z | - |
dc.date.created | 2005 | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | DINH, 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-133 | en |
dc.identifier.issn | 0944-6532 | - |
dc.identifier.uri | http://hdl.handle.net/10045/8805 | - |
dc.description.abstract | This 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.sponsorship | This research was partially supported by MCYT of Spain and FEDER of EU, Grant BMF2002-04114- C02-01. | en |
dc.language | eng | en |
dc.publisher | Heldermann Verlag | en |
dc.subject | Convex infinite programming | en |
dc.subject | Constraint qualifications | en |
dc.subject.other | Matemáticas | en |
dc.title | From linear to convex systems: consistency, Farkas' Lemma and applications | en |
dc.type | info:eu-repo/semantics/article | en |
dc.peerreviewed | si | en |
dc.rights.accessRights | info:eu-repo/semantics/restrictedAccess | - |
Aparece en las colecciones: | INV - LOPT - Artículos de Revistas |
Archivos en este ítem:
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
DGL05JCA.pdf | Versión revisada (acceso libre) | 192,66 kB | Adobe PDF | Abrir Vista previa |
jca0534_b.pdf | Versión final (acceso restringido) | 465,31 kB | Adobe PDF | Abrir Solicitar una copia |
Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.