Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/29228
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHung, NC-
dc.contributor.authorChuong, TD-
dc.contributor.authorAnh, NLH-
dc.date.accessioned2024-06-19T13:54:29Z-
dc.date.available2024-06-19T13:54:29Z-
dc.date.issued2024-05-28-
dc.identifierORCiD: Chuong Thai Doan https://orcid.org/0000-0003-0893-5604-
dc.identifier.citationHung, N.C., Chuong, T.D. and Anh, N.L.H. (2024) 'Optimality and Duality for Robust Optimization Problems Involving Intersection of Closed Sets', Journal of Optimization Theory and Applications, 0 (ahead of print), pp. 1 - 20. doi: 10.1007/s10957-024-02447-wen_US
dc.identifier.issn0022-3239-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/29228-
dc.description.abstractIn this paper, we study a robust optimization problem whose constraints include nonsmooth and nonconvex functions and the intersection of closed sets. Using advanced variational analysis tools, we first provide necessary conditions for the optimality of the robust optimization problem. We then establish sufficient conditions for the optimality of the considered problem under the assumption of generalized convexity. In addition, we present a dual problem to the primal robust optimization problem and examine duality relations.en_US
dc.description.sponsorshipVietnam National University Ho Chi Minh City (VNU-HCM) under grant number T2024-26-01.en_US
dc.format.extent1 - 24-
dc.format.mediumPrint-Electronic-
dc.language.isoen_USen_US
dc.publisherSpringer Natureen_US
dc.rightsCopyright © The Author(s) 2024. Rights and permissions: Open Access. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit https://creativecommons.org/licenses/by/4.0/.-
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/-
dc.subjectrobust nonsmooth optimizationen_US
dc.subjectoptimality conditionen_US
dc.subjectMordukhovich/limiting subdifferentialen_US
dc.subjectdualityen_US
dc.subjectconstrainten_US
dc.subjectclosed seten_US
dc.titleOptimality and Duality for Robust Optimization Problems Involving Intersection of Closed Setsen_US
dc.typeArticleen_US
dc.date.dateAccepted2024-04-26-
dc.identifier.doihttps://doi.org/10.1007/s10957-024-02447-w-
dc.relation.isPartOfJournal of Optimization Theory and Applications-
pubs.publication-statusPublished-
pubs.volume0-
dc.identifier.eissn1573-2878-
dc.rights.licensehttps://creativecommons.org/licenses/by/4.0/legalcode.en-
dc.rights.holderThe Author(s)-
Appears in Collections:Dept of Mathematics Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © The Author(s) 2024. Rights and permissions: Open Access. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit https://creativecommons.org/licenses/by/4.0/.434.23 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons