每次迭代最多一次降阶尝试的无启示一阶低秩优化算法

{"title":"每次迭代最多一次降阶尝试的无启示一阶低秩优化算法","authors":"Guillaume Olikier, P.-A. Absil","doi":"10.1137/22m1518256","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":49538,"journal":{"name":"SIAM Journal on Matrix Analysis and Applications","volume":"10 1","pages":"0"},"PeriodicalIF":1.5000,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Apocalypse-Free First-Order Low-Rank Optimization Algorithm with at Most One Rank Reduction Attempt per Iteration\",\"authors\":\"Guillaume Olikier, P.-A. Absil\",\"doi\":\"10.1137/22m1518256\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":49538,\"journal\":{\"name\":\"SIAM Journal on Matrix Analysis and Applications\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2023-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Matrix Analysis and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/22m1518256\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Matrix Analysis and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/22m1518256","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}