Optimization Online


On the Iteration Complexity of Some Projection Methods for Monotone Linear Variational Inequalities

Caihua Chen(chchen***at***nju.edu.cn)
Xiaoling Fu(fuxlnju***at***hotmail.com)
Bingsheng He(hebma***at***nju.edu.cn)
Xiaoming Yuan(xmyuan***at***hkbu.edu.hk)

Abstract: Projection type methods are among the most important methods for solving monotone linear variational inequalities. In this note, we analyze the iteration complexity for two projection methods and accordingly establish their worst-case O(1/t) convergence rates measured by the iteration complexity in both the ergodic and nonergodic senses, where t is the iteration counter. 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.

Keywords: Linear variational inequality, projection methods, convergence rate, iteration complexity

Category 1: Complementarity and Variational Inequalities


Download: [PDF]

Entry Submitted: 01/13/2015
Entry Accepted: 01/13/2015
Entry Last Modified: 01/13/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society