H. Rehman, P. Kumam, Y. Shehu, Murat Ozdemir, W. Kumam
{"title":"求解平衡问题的惯性非单调自适应迭代算法","authors":"H. Rehman, P. Kumam, Y. Shehu, Murat Ozdemir, W. Kumam","doi":"10.23952/jnva.6.2022.1.04","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce a modification of the extragradient algorithm with a non-monotonic stepsize rule to solve equilibrium problems. This modification is based on the inertial subgradient technique. Under mild conditions, such as, the Lipschitz continuity and the monotonicity of a bifunction (including the pseudomonotonicity), the strong convergence of the proposed algorithm is established in a real Hilbert space. The proposed algorithm uses a non-monotonic stepsize rule based on the local bifunction information rather than its Lipschitz-type constants or other line search methods. We present various numerical examples, which illustrate the strong convergence of the algorithm.","PeriodicalId":48488,"journal":{"name":"Journal of Nonlinear and Variational Analysis","volume":null,"pages":null},"PeriodicalIF":2.5000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An inertial non-monotonic self-adaptive iterative algorithm for solving equilibrium problems\",\"authors\":\"H. Rehman, P. Kumam, Y. Shehu, Murat Ozdemir, W. Kumam\",\"doi\":\"10.23952/jnva.6.2022.1.04\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce a modification of the extragradient algorithm with a non-monotonic stepsize rule to solve equilibrium problems. This modification is based on the inertial subgradient technique. Under mild conditions, such as, the Lipschitz continuity and the monotonicity of a bifunction (including the pseudomonotonicity), the strong convergence of the proposed algorithm is established in a real Hilbert space. The proposed algorithm uses a non-monotonic stepsize rule based on the local bifunction information rather than its Lipschitz-type constants or other line search methods. We present various numerical examples, which illustrate the strong convergence of the algorithm.\",\"PeriodicalId\":48488,\"journal\":{\"name\":\"Journal of Nonlinear and Variational Analysis\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.5000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Nonlinear and Variational Analysis\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.23952/jnva.6.2022.1.04\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Nonlinear and Variational Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.23952/jnva.6.2022.1.04","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
An inertial non-monotonic self-adaptive iterative algorithm for solving equilibrium problems
In this paper, we introduce a modification of the extragradient algorithm with a non-monotonic stepsize rule to solve equilibrium problems. This modification is based on the inertial subgradient technique. Under mild conditions, such as, the Lipschitz continuity and the monotonicity of a bifunction (including the pseudomonotonicity), the strong convergence of the proposed algorithm is established in a real Hilbert space. The proposed algorithm uses a non-monotonic stepsize rule based on the local bifunction information rather than its Lipschitz-type constants or other line search methods. We present various numerical examples, which illustrate the strong convergence of the algorithm.