Abstract
The variational inequality problem have many important applications in the fields of signal processing, image processing, optimal control and many others. In this paper, we introduce two projection algorithms for solving strongly pseudomonotone variational inequalities. The considered methodsare based on some existing ones. Our algorithms use dynamicstep-sizes, chosen based on information of previous steps andtheir strong convergence is proved without the Lipschitz continuity of the underlying mappings. Some numerical experiments are presented to verify the effectiveness of the proposedalgorithms.
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.
