File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s10957-016-1051-6
- Scopus: eid_2-s2.0-85008626077
- WOS: WOS:000395084600009
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: On the Iteration Complexity of Some Projection Methods for Monotone Linear Variational Inequalities
| Title | On the Iteration Complexity of Some Projection Methods for Monotone Linear Variational Inequalities |
|---|---|
| Authors | |
| Keywords | Linear variational inequality Convergence rate Iteration complexity Projection methods |
| Issue Date | 2017 |
| 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 Identifier | http://hdl.handle.net/10722/251193 |
| ISSN | 2021 Impact Factor: 2.189 2020 SCImago Journal Rankings: 1.109 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chen, Caihua | - |
| dc.contributor.author | Fu, Xiaoling | - |
| dc.contributor.author | He, Bingsheng | - |
| dc.contributor.author | Yuan, Xiaoming | - |
| dc.date.accessioned | 2018-02-01T01:54:52Z | - |
| dc.date.available | 2018-02-01T01:54:52Z | - |
| dc.date.issued | 2017 | - |
| dc.identifier.citation | Journal of Optimization Theory and Applications, 2017, v. 172, n. 3, p. 914-928 | - |
| dc.identifier.issn | 0022-3239 | - |
| dc.identifier.uri | http://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.language | eng | - |
| dc.relation.ispartof | Journal of Optimization Theory and Applications | - |
| dc.subject | Linear variational inequality | - |
| dc.subject | Convergence rate | - |
| dc.subject | Iteration complexity | - |
| dc.subject | Projection methods | - |
| dc.title | On the Iteration Complexity of Some Projection Methods for Monotone Linear Variational Inequalities | - |
| dc.type | Article | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.doi | 10.1007/s10957-016-1051-6 | - |
| dc.identifier.scopus | eid_2-s2.0-85008626077 | - |
| dc.identifier.volume | 172 | - |
| dc.identifier.issue | 3 | - |
| dc.identifier.spage | 914 | - |
| dc.identifier.epage | 928 | - |
| dc.identifier.eissn | 1573-2878 | - |
| dc.identifier.isi | WOS:000395084600009 | - |
| dc.identifier.issnl | 0022-3239 | - |