{"title":"水平集正则化在优化问题中的应用","authors":"M. Barro, S. Traoré","doi":"10.4067/s0719-06462020000100137","DOIUrl":null,"url":null,"abstract":"Given a coupling function \\(c\\) and a non empty subset of ℝ, we define a closure operator. We are interested in extended real-valued functions whose sub-level sets are closed for this operator. Since this class of functions is closed under pointwise suprema, we introduce a regularization for extended real-valued functions. By decomposition of the closure operator using polarity scheme, we recover the regularization by bi-conjugation. We apply our results to derive a strong duality for a minimization problem.","PeriodicalId":36416,"journal":{"name":"Cubo","volume":" ","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Level sets regularization with application to optimization problems\",\"authors\":\"M. Barro, S. Traoré\",\"doi\":\"10.4067/s0719-06462020000100137\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a coupling function \\\\(c\\\\) and a non empty subset of ℝ, we define a closure operator. We are interested in extended real-valued functions whose sub-level sets are closed for this operator. Since this class of functions is closed under pointwise suprema, we introduce a regularization for extended real-valued functions. By decomposition of the closure operator using polarity scheme, we recover the regularization by bi-conjugation. We apply our results to derive a strong duality for a minimization problem.\",\"PeriodicalId\":36416,\"journal\":{\"name\":\"Cubo\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2020-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cubo\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4067/s0719-06462020000100137\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cubo","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4067/s0719-06462020000100137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
Level sets regularization with application to optimization problems
Given a coupling function \(c\) and a non empty subset of ℝ, we define a closure operator. We are interested in extended real-valued functions whose sub-level sets are closed for this operator. Since this class of functions is closed under pointwise suprema, we introduce a regularization for extended real-valued functions. By decomposition of the closure operator using polarity scheme, we recover the regularization by bi-conjugation. We apply our results to derive a strong duality for a minimization problem.