Optimality conditions for convex problems on intersections of non necessarily convex sets

We present necessary and sufficient optimality conditions for the minimization of pseudoconvex functions over convex intersections of non necessarily convex sets. To this aim, we use the notion of local normal cone to a closed set at a point, due to Linh and Penot (SIAM J Optim 17:500-510, 2006). Th...

Descripción completa

Detalles Bibliográficos
Autores: Allevi, Elisabetta|||0000-0003-4914-9124, Riccardi, Rossana, Martínez Legaz, Juan Enrique|||0000-0002-6845-6202
Tipo de recurso: artículo
Fecha de publicación:2020
País:España
Institución:Universitat Autònoma de Barcelona
Repositorio:Dipòsit Digital de Documents de la UAB
Idioma:inglés
OAI Identifier:oai:ddd.uab.cat:224366
Acceso en línea:https://ddd.uab.cat/record/224366
https://dx.doi.org/urn:doi:10.1007/s10898-019-00849-z
Access Level:acceso abierto
Palabra clave:Convex optimization
Nonsmooth optimization
Optimality conditions
id ES_e690bb39367e67f1b9fda5ca46bb5747
oai_identifier_str oai:ddd.uab.cat:224366
network_acronym_str ES
network_name_str España
repository_id_str
spelling Optimality conditions for convex problems on intersections of non necessarily convex setsAllevi, Elisabetta|||0000-0003-4914-9124Riccardi, RossanaMartínez Legaz, Juan Enrique|||0000-0002-6845-6202Convex optimizationNonsmooth optimizationOptimality conditionsWe present necessary and sufficient optimality conditions for the minimization of pseudoconvex functions over convex intersections of non necessarily convex sets. To this aim, we use the notion of local normal cone to a closed set at a point, due to Linh and Penot (SIAM J Optim 17:500-510, 2006). The technique we use to obtain the optimality conditions is based on the so called canonical representation of a closed set by means of its associated oriented distance function. 22020-01-0120202020-01-01Articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/pdfhttps://ddd.uab.cat/record/224366https://dx.doi.org/urn:doi:10.1007/s10898-019-00849-zreponame:Dipòsit Digital de Documents de la UABinstname:Universitat Autònoma de BarcelonaInglésengMinisterio de Economía y Competitividad https://doi.org/10.13039/501100003329 MTM2014-59179-C2-2-Popen accesshttp://purl.org/coar/access_right/c_abf2Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.https://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:ddd.uab.cat:2243662026-06-06T12:50:31Z
dc.title.none.fl_str_mv Optimality conditions for convex problems on intersections of non necessarily convex sets
title Optimality conditions for convex problems on intersections of non necessarily convex sets
spellingShingle Optimality conditions for convex problems on intersections of non necessarily convex sets
Allevi, Elisabetta|||0000-0003-4914-9124
Convex optimization
Nonsmooth optimization
Optimality conditions
title_short Optimality conditions for convex problems on intersections of non necessarily convex sets
title_full Optimality conditions for convex problems on intersections of non necessarily convex sets
title_fullStr Optimality conditions for convex problems on intersections of non necessarily convex sets
title_full_unstemmed Optimality conditions for convex problems on intersections of non necessarily convex sets
title_sort Optimality conditions for convex problems on intersections of non necessarily convex sets
dc.creator.none.fl_str_mv Allevi, Elisabetta|||0000-0003-4914-9124
Riccardi, Rossana
Martínez Legaz, Juan Enrique|||0000-0002-6845-6202
author Allevi, Elisabetta|||0000-0003-4914-9124
author_facet Allevi, Elisabetta|||0000-0003-4914-9124
Riccardi, Rossana
Martínez Legaz, Juan Enrique|||0000-0002-6845-6202
author_role author
author2 Riccardi, Rossana
Martínez Legaz, Juan Enrique|||0000-0002-6845-6202
author2_role author
author
dc.subject.none.fl_str_mv Convex optimization
Nonsmooth optimization
Optimality conditions
topic Convex optimization
Nonsmooth optimization
Optimality conditions
description We present necessary and sufficient optimality conditions for the minimization of pseudoconvex functions over convex intersections of non necessarily convex sets. To this aim, we use the notion of local normal cone to a closed set at a point, due to Linh and Penot (SIAM J Optim 17:500-510, 2006). The technique we use to obtain the optimality conditions is based on the so called canonical representation of a closed set by means of its associated oriented distance function.
publishDate 2020
dc.date.none.fl_str_mv 2
2020-01-01
2020
2020-01-01
dc.type.none.fl_str_mv Article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://ddd.uab.cat/record/224366
https://dx.doi.org/urn:doi:10.1007/s10898-019-00849-z
url https://ddd.uab.cat/record/224366
https://dx.doi.org/urn:doi:10.1007/s10898-019-00849-z
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Ministerio de Economía y Competitividad https://doi.org/10.13039/501100003329 MTM2014-59179-C2-2-P
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
https://rightsstatements.org/vocab/InC/1.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
https://rightsstatements.org/vocab/InC/1.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Dipòsit Digital de Documents de la UAB
instname:Universitat Autònoma de Barcelona
instname_str Universitat Autònoma de Barcelona
reponame_str Dipòsit Digital de Documents de la UAB
collection Dipòsit Digital de Documents de la UAB
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869422777612632064
score 15,300724