File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1080/02331934.2010.522714
- Scopus: eid_2-s2.0-84859587064
- WOS: WOS:000304274700002
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Some proximal algorithms for linearly constrained general variational inequalities
Title | Some proximal algorithms for linearly constrained general variational inequalities |
---|---|
Authors | |
Keywords | inexact methods general variational inequality proximal point algorithm linear constraint |
Issue Date | 2012 |
Citation | Optimization, 2012, v. 61, n. 5, p. 505-524 How to Cite? |
Abstract | Based on the classical proximal point algorithm (PPA), some PPA-based numerical algorithms for general variational inequalities (GVIs) have been developed recently. Inspired by these algorithms, in this article we propose some proximal algorithms for solving linearly constrained GVIs (LCGVIs). The resulted subproblems are regularized proximally, and they are allowed to be solved either exactly or approximately. © 2012 Copyright Taylor and Francis Group, LLC. |
Persistent Identifier | http://hdl.handle.net/10722/250986 |
ISSN | 2023 Impact Factor: 1.6 2023 SCImago Journal Rankings: 0.699 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, M. | - |
dc.contributor.author | Yuan, X. M. | - |
dc.date.accessioned | 2018-02-01T01:54:15Z | - |
dc.date.available | 2018-02-01T01:54:15Z | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | Optimization, 2012, v. 61, n. 5, p. 505-524 | - |
dc.identifier.issn | 0233-1934 | - |
dc.identifier.uri | http://hdl.handle.net/10722/250986 | - |
dc.description.abstract | Based on the classical proximal point algorithm (PPA), some PPA-based numerical algorithms for general variational inequalities (GVIs) have been developed recently. Inspired by these algorithms, in this article we propose some proximal algorithms for solving linearly constrained GVIs (LCGVIs). The resulted subproblems are regularized proximally, and they are allowed to be solved either exactly or approximately. © 2012 Copyright Taylor and Francis Group, LLC. | - |
dc.language | eng | - |
dc.relation.ispartof | Optimization | - |
dc.subject | inexact methods | - |
dc.subject | general variational inequality | - |
dc.subject | proximal point algorithm | - |
dc.subject | linear constraint | - |
dc.title | Some proximal algorithms for linearly constrained general variational inequalities | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1080/02331934.2010.522714 | - |
dc.identifier.scopus | eid_2-s2.0-84859587064 | - |
dc.identifier.volume | 61 | - |
dc.identifier.issue | 5 | - |
dc.identifier.spage | 505 | - |
dc.identifier.epage | 524 | - |
dc.identifier.eissn | 1029-4945 | - |
dc.identifier.isi | WOS:000304274700002 | - |
dc.identifier.issnl | 0233-1934 | - |