{"title":"变分不等式问题的一种自适应步长惯性次梯度外聚算法","authors":"Xiaokai Chang, Sanyang Liu, Zhao Deng, Suoping Li","doi":"10.1080/10556788.2021.1910946","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce an efficient subgradient extragradient (SE) based method for solving variational inequality problems with monotone operator in Hilbert space. In many existing SE methods, two values of operator are needed over each iteration and the Lipschitz constant of the operator or linesearch is required for estimating step sizes, which are usually not practical and expensive. To overcome these drawbacks, we present an inertial SE based algorithm with adaptive step sizes, estimated by using an approximation of the local Lipschitz constant without running a linesearch. Each iteration of the method only requires a projection on the feasible set and a value of the operator. The numerical experiments illustrate the efficiency of the proposed algorithm.","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems\",\"authors\":\"Xiaokai Chang, Sanyang Liu, Zhao Deng, Suoping Li\",\"doi\":\"10.1080/10556788.2021.1910946\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce an efficient subgradient extragradient (SE) based method for solving variational inequality problems with monotone operator in Hilbert space. In many existing SE methods, two values of operator are needed over each iteration and the Lipschitz constant of the operator or linesearch is required for estimating step sizes, which are usually not practical and expensive. To overcome these drawbacks, we present an inertial SE based algorithm with adaptive step sizes, estimated by using an approximation of the local Lipschitz constant without running a linesearch. Each iteration of the method only requires a projection on the feasible set and a value of the operator. The numerical experiments illustrate the efficiency of the proposed algorithm.\",\"PeriodicalId\":124811,\"journal\":{\"name\":\"Optimization Methods and Software\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Optimization Methods and Software\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/10556788.2021.1910946\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization Methods and Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/10556788.2021.1910946","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems
In this paper, we introduce an efficient subgradient extragradient (SE) based method for solving variational inequality problems with monotone operator in Hilbert space. In many existing SE methods, two values of operator are needed over each iteration and the Lipschitz constant of the operator or linesearch is required for estimating step sizes, which are usually not practical and expensive. To overcome these drawbacks, we present an inertial SE based algorithm with adaptive step sizes, estimated by using an approximation of the local Lipschitz constant without running a linesearch. Each iteration of the method only requires a projection on the feasible set and a value of the operator. The numerical experiments illustrate the efficiency of the proposed algorithm.