File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s10957-009-9619-z
- Scopus: eid_2-s2.0-77952011738
- WOS: WOS:000276743300006
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: New parallel descent-like method for solving a class of variational inequalities
Title | New parallel descent-like method for solving a class of variational inequalities |
---|---|
Authors | |
Keywords | Parallel computing Descent-like methods Alternating direction methods Augmented Lagrangian method Variational inequalities |
Issue Date | 2010 |
Citation | Journal of Optimization Theory and Applications, 2010, v. 145, n. 2, p. 311-323 How to Cite? |
Abstract | To solve a class of variational inequalities with separable structures, some classical methods such as the augmented Lagrangian method and the alternating direction methods require solving two subvariational inequalities at each iteration. The most recent work (B. S. He in Comput. Optim. Appl. 42(2):195-212, 2009) improved these classical methods by allowing the subvariational inequalities arising at each iteration to be solved in parallel, at the price of executing an additional descent step. This paper aims at developing this strategy further by refining the descent directions in the descent steps, while preserving the practical characteristics suitable for parallel computing. Convergence of the new parallel descent-like method is proved under the same mild assumptions on the problem data. © 2009 Springer Science+Business Media, LLC. |
Persistent Identifier | http://hdl.handle.net/10722/250938 |
ISSN | 2023 Impact Factor: 1.6 2023 SCImago Journal Rankings: 0.864 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jiang, Z. K. | - |
dc.contributor.author | Yuan, X. M. | - |
dc.date.accessioned | 2018-02-01T01:54:07Z | - |
dc.date.available | 2018-02-01T01:54:07Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | Journal of Optimization Theory and Applications, 2010, v. 145, n. 2, p. 311-323 | - |
dc.identifier.issn | 0022-3239 | - |
dc.identifier.uri | http://hdl.handle.net/10722/250938 | - |
dc.description.abstract | To solve a class of variational inequalities with separable structures, some classical methods such as the augmented Lagrangian method and the alternating direction methods require solving two subvariational inequalities at each iteration. The most recent work (B. S. He in Comput. Optim. Appl. 42(2):195-212, 2009) improved these classical methods by allowing the subvariational inequalities arising at each iteration to be solved in parallel, at the price of executing an additional descent step. This paper aims at developing this strategy further by refining the descent directions in the descent steps, while preserving the practical characteristics suitable for parallel computing. Convergence of the new parallel descent-like method is proved under the same mild assumptions on the problem data. © 2009 Springer Science+Business Media, LLC. | - |
dc.language | eng | - |
dc.relation.ispartof | Journal of Optimization Theory and Applications | - |
dc.subject | Parallel computing | - |
dc.subject | Descent-like methods | - |
dc.subject | Alternating direction methods | - |
dc.subject | Augmented Lagrangian method | - |
dc.subject | Variational inequalities | - |
dc.title | New parallel descent-like method for solving a class of variational inequalities | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/s10957-009-9619-z | - |
dc.identifier.scopus | eid_2-s2.0-77952011738 | - |
dc.identifier.volume | 145 | - |
dc.identifier.issue | 2 | - |
dc.identifier.spage | 311 | - |
dc.identifier.epage | 323 | - |
dc.identifier.eissn | 1573-2878 | - |
dc.identifier.isi | WOS:000276743300006 | - |
dc.identifier.issnl | 0022-3239 | - |