Abstract
In this paper, we propose a new algorithm for solving monotone mixed variational inequality problems in real Hilbert spaces based on proximal gradient method. Our new algorithm uses a novel explicit stepsize which is proved to be increasing to a positive limitation. This property plays an important role in improving the speed of the algorithm. To the best of our knowledge, it is the first time such a kind of stepsize has been proposed for the proximal gradient method solving mixed variational inequality problems. We prove the weak convergence and strong convergence with R-linear rate of our new algorithm under standard assumptions. The reported numerical simulations for applications in sparse logistic regression and image deblurring reveal the significant efficacy performance of our proposed method compared to the recent ones.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.