具有凸约束的非凸优化的定步长SQP方法的迭代复杂度

{"title":"具有凸约束的非凸优化的定步长SQP方法的迭代复杂度","authors":"F. Facchinei, V. Kungurtsev, Lorenzo Lampariello, G. Scutari","doi":"10.1007/978-3-030-72040-7_5","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":36287,"journal":{"name":"Iranian Journal of Numerical Analysis and Optimization","volume":"4 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Iteration Complexity of a Fixed-Stepsize SQP Method for Nonconvex Optimization with Convex Constraints\",\"authors\":\"F. Facchinei, V. Kungurtsev, Lorenzo Lampariello, G. Scutari\",\"doi\":\"10.1007/978-3-030-72040-7_5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":36287,\"journal\":{\"name\":\"Iranian Journal of Numerical Analysis and Optimization\",\"volume\":\"4 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Iranian Journal of Numerical Analysis and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-72040-7_5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iranian Journal of Numerical Analysis and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-72040-7_5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}