集合优化的定向和近似效率

Pub Date : 2023-11-29 DOI:10.1007/s00186-023-00840-1

Marius Durea, Elena-Andreea Florea

{"title":"集合优化的定向和近似效率","authors":"Marius Durea, Elena-Andreea Florea","doi":"10.1007/s00186-023-00840-1","DOIUrl":null,"url":null,"abstract":"<p>We investigate, in the framework of set optimization, some issues that are well studied in vectorial setting, that is, penalization procedures, properness of solutions and optimality conditions on primal spaces. Therefore, with this study we aim at completing the literature dedicated to set optimization with some results that have well established correspondence in the classical vector optimization.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Directional and approximate efficiency in set optimization\",\"authors\":\"Marius Durea, Elena-Andreea Florea\",\"doi\":\"10.1007/s00186-023-00840-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We investigate, in the framework of set optimization, some issues that are well studied in vectorial setting, that is, penalization procedures, properness of solutions and optimality conditions on primal spaces. Therefore, with this study we aim at completing the literature dedicated to set optimization with some results that have well established correspondence in the classical vector optimization.</p>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2023-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00186-023-00840-1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00186-023-00840-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在集合优化的框架下，我们研究了向量集合中已经得到很好研究的一些问题，即惩罚程序、解的适当性和原始空间上的最优性条件。因此，在本研究中，我们的目标是完成集优化的文献，其中一些结果在经典向量优化中已经建立了良好的对应关系。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

Directional and approximate efficiency in set optimization

We investigate, in the framework of set optimization, some issues that are well studied in vectorial setting, that is, penalization procedures, properness of solutions and optimality conditions on primal spaces. Therefore, with this study we aim at completing the literature dedicated to set optimization with some results that have well established correspondence in the classical vector optimization.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助