{"title":"克拉克切锥、子梯度、最优条件和无穷远处的唇边性","authors":"Minh Tùng Nguyễn, Tiến-Sơn Phạm","doi":"10.1137/23m1545367","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Optimization, Volume 34, Issue 2, Page 1732-1754, June 2024. <br/> Abstract. We first study Clarke’s tangent cones at infinity to unbounded subsets of [math]. We prove that these cones are closed convex and show a characterization of their interiors. We then study subgradients at infinity for extended real value functions on [math] and derive necessary optimality conditions at infinity for optimization problems. We also give a number of rules for the computing of subgradients at infinity and provide some characterizations of the Lipschitz continuity at infinity for lower semicontinuous functions.","PeriodicalId":49529,"journal":{"name":"SIAM Journal on Optimization","volume":null,"pages":null},"PeriodicalIF":2.6000,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Clarke’s Tangent Cones, Subgradients, Optimality Conditions, and the Lipschitzness at Infinity\",\"authors\":\"Minh Tùng Nguyễn, Tiến-Sơn Phạm\",\"doi\":\"10.1137/23m1545367\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Optimization, Volume 34, Issue 2, Page 1732-1754, June 2024. <br/> Abstract. We first study Clarke’s tangent cones at infinity to unbounded subsets of [math]. We prove that these cones are closed convex and show a characterization of their interiors. We then study subgradients at infinity for extended real value functions on [math] and derive necessary optimality conditions at infinity for optimization problems. We also give a number of rules for the computing of subgradients at infinity and provide some characterizations of the Lipschitz continuity at infinity for lower semicontinuous functions.\",\"PeriodicalId\":49529,\"journal\":{\"name\":\"SIAM Journal on Optimization\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2024-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/23m1545367\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1545367","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Clarke’s Tangent Cones, Subgradients, Optimality Conditions, and the Lipschitzness at Infinity
SIAM Journal on Optimization, Volume 34, Issue 2, Page 1732-1754, June 2024. Abstract. We first study Clarke’s tangent cones at infinity to unbounded subsets of [math]. We prove that these cones are closed convex and show a characterization of their interiors. We then study subgradients at infinity for extended real value functions on [math] and derive necessary optimality conditions at infinity for optimization problems. We also give a number of rules for the computing of subgradients at infinity and provide some characterizations of the Lipschitz continuity at infinity for lower semicontinuous functions.
期刊介绍:
The SIAM Journal on Optimization contains research articles on the theory and practice of optimization. The areas addressed include linear and quadratic programming, convex programming, nonlinear programming, complementarity problems, stochastic optimization, combinatorial optimization, integer programming, and convex, nonsmooth and variational analysis. Contributions may emphasize optimization theory, algorithms, software, computational practice, applications, or the links between these subjects.