A relaxed version of the gradient projection method for variational inequalities with applications
DOI:
https://doi.org/10.24193/subbmath.2022.1.06Keywords:
Variational inequality, gradient projection method, strong convergence, LASSO problem, image deblurring problemAbstract
In this paper, we propose a relaxed version of gradient projection method for strongly monotone variational inequalities defined on a level set of a (possibly non-differentiable) convex function. Our algorithms can be implemented easily since it computes on every iteration one projection onto some half-space containing the feasible set and only one value of the underlying mapping. Under mild and standard conditions we establish the strong convergence of the proposed algorithm. The performance is presented through a numerical example in solving the image deblurring problem and compare this algorithm with other algorithms in the literature.Downloads
Published
2022-03-10
Issue
Section
Articles
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Transfer of copyright agreement: When the article is accepted for publication, the authors and the representative of the coauthors, hereby agree to transfer to Studia Universitatis Babeș-Bolyai Mathematica all rights, including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the authors specifically retain: the authors can use the material however they want as long as it fits the NC ND terms of the license. The authors have all rights for reuse according to the license.
