Abstract
In this paper, we investigate two new algorithms for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The advantages of our algorithms are that they only need to calculate one projection on the feasible set in each iteration, and do not require the prior information of the Lipschitz constant of the cost operator. Furthermore, two new algorithms are derived to solve variational inequality problems. We establish the strong convergence of the proposed algorithms under some suitable conditions imposed on parameters. Finally, several numerical results and applications in optimal control problems are reported to illustrate the efficiency and advantages of the proposed algorithms.
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.
