{"title":"利用米夫林线搜索进行非平滑非凸优化的下降子梯度法","authors":"Morteza Maleknia, Majid Soleimani-damaneh","doi":"10.1080/02331934.2024.2322152","DOIUrl":null,"url":null,"abstract":"We propose a descent subgradient algorithm for minimizing a function f:Rn→R, assumed to be locally Lipschitz, but not necessarily smooth or convex. To find an effective descent direction, the Golds...","PeriodicalId":54671,"journal":{"name":"Optimization","volume":"12 1","pages":""},"PeriodicalIF":1.6000,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization\",\"authors\":\"Morteza Maleknia, Majid Soleimani-damaneh\",\"doi\":\"10.1080/02331934.2024.2322152\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a descent subgradient algorithm for minimizing a function f:Rn→R, assumed to be locally Lipschitz, but not necessarily smooth or convex. To find an effective descent direction, the Golds...\",\"PeriodicalId\":54671,\"journal\":{\"name\":\"Optimization\",\"volume\":\"12 1\",\"pages\":\"\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2024-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1080/02331934.2024.2322152\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/02331934.2024.2322152","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
We propose a descent subgradient algorithm for minimizing a function f:Rn→R, assumed to be locally Lipschitz, but not necessarily smooth or convex. To find an effective descent direction, the Golds...
期刊介绍：
Optimization publishes refereed, theoretical and applied papers on the latest developments in fields such as linear, nonlinear, stochastic, parametric, discrete and dynamic programming, control theory and game theory.
A special section is devoted to review papers on theory and methods in interesting areas of mathematical programming and optimization techniques. The journal also publishes conference proceedings, book reviews and announcements.
All published research articles in this journal have undergone rigorous peer review, based on initial editor screening and anonymous refereeing by independent expert referees.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
