Weak and strong convergence of a modified adaptive generalized Popov's algorithm for solving variational inequality problems
In this paper, we introduce a modified adaptive step-size algorithm by basing a generalized Popov's method to solve variational inequality problems in a real Hilbert space. The algorithm only needs to act on the operator once time in each iteration, which greatly reduces the calculation time an...
Saved in:
Published in | Optimization Vol. 73; no. 8; pp. 2695 - 2720 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Philadelphia
Taylor & Francis
02.08.2024
Taylor & Francis LLC |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this paper, we introduce a modified adaptive step-size algorithm by basing a generalized Popov's method to solve variational inequality problems in a real Hilbert space. The algorithm only needs to act on the operator once time in each iteration, which greatly reduces the calculation time and calculation difficulty. Of particular interesting, by using our new same generalized Popov's method, we also weaken the conditions of the operator about weak continuity and quasi-monotone property. Of particular interesting, by using our new same generalized Popov's method, we can obtain a weak convergence result under the condition that the operator A is quasi-monotone and a R-linear convergence result under the condition that the operator A is strongly pseudo-monotone in the variational inequality, respectively. Finally, the feasibility and effectiveness of the algorithm are verified by some numerical experiments. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 0233-1934 1029-4945 |
DOI: | 10.1080/02331934.2023.2231213 |