Abstract
It is well known that the gradient-projection algorithm plays an important role in solving minimization problems. In this paper, we will use the idea of regularization to establish a general method so that the sequence generated by the general method can be strongly convergent to a minimizer of constrained convex minimization problems, which solves a variational inequality under suitable conditions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
