File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

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

TitleOn the Iteration Complexity of Some Projection Methods for Monotone Linear Variational Inequalities
Authors
KeywordsLinear variational inequality
Convergence rate
Iteration complexity
Projection methods
Issue Date2017
Citation
Journal of Optimization Theory and Applications, 2017, v. 172, n. 3, p. 914-928 How to Cite?
Abstract© 2017, Springer Science+Business Media New York. 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.
Persistent Identifierhttp://hdl.handle.net/10722/251193
ISSN
2023 Impact Factor: 1.6
2023 SCImago Journal Rankings: 0.864
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChen, Caihua-
dc.contributor.authorFu, Xiaoling-
dc.contributor.authorHe, Bingsheng-
dc.contributor.authorYuan, Xiaoming-
dc.date.accessioned2018-02-01T01:54:52Z-
dc.date.available2018-02-01T01:54:52Z-
dc.date.issued2017-
dc.identifier.citationJournal of Optimization Theory and Applications, 2017, v. 172, n. 3, p. 914-928-
dc.identifier.issn0022-3239-
dc.identifier.urihttp://hdl.handle.net/10722/251193-
dc.description.abstract© 2017, Springer Science+Business Media New York. 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.-
dc.languageeng-
dc.relation.ispartofJournal of Optimization Theory and Applications-
dc.subjectLinear variational inequality-
dc.subjectConvergence rate-
dc.subjectIteration complexity-
dc.subjectProjection methods-
dc.titleOn the Iteration Complexity of Some Projection Methods for Monotone Linear Variational Inequalities-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/s10957-016-1051-6-
dc.identifier.scopuseid_2-s2.0-85008626077-
dc.identifier.volume172-
dc.identifier.issue3-
dc.identifier.spage914-
dc.identifier.epage928-
dc.identifier.eissn1573-2878-
dc.identifier.isiWOS:000395084600009-
dc.identifier.issnl0022-3239-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats