Abstract
Projection-type methods are important for solving monotone linear variational inequalities. In this paper, we analyze the iteration complexity of two projection methods and accordingly establish their worst-case sublinear convergence rates measured by the iteration complexity in both the ergodic and nonergodic senses. Our analysis does not require any error bound condition or the boundedness of the feasible set, and it is scalable to other methods of the same kind.
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.