| dc.contributor.author | Vu, Bang Cong | |
| dc.date.accessioned | 2017-04-07T22:03:59Z | |
| dc.date.available | 2017-04-07T22:03:59Z | |
| dc.date.issued | 2015-05 | |
| dc.date.submitted | 2014-10 | |
| dc.identifier.issn | 1862-4472 | |
| dc.identifier.issn | 1862-4480 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/107987 | |
| dc.description.abstract | In this paper, we propose a stochastic forward–backward–forward splitting algorithm and prove its almost sure weak convergence in real separable Hilbert spaces. Applications to composite monotone inclusion and minimization problems are demonstrated. | en_US |
| dc.publisher | Springer-Verlag | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1007/s11590-015-0904-5 | en_US |
| dc.rights | Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. | en_US |
| dc.source | Springer Berlin Heidelberg | en_US |
| dc.title | Almost sure convergence of the forward–backward–forward splitting algorithm | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Vũ, Bằng Công. “Almost Sure Convergence of the Forward–backward–forward Splitting Algorithm.” Optim Lett 10, no. 4 (May 23, 2015): 781–803. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology | en_US |
| dc.contributor.mitauthor | Vu, Bang Cong | |
| dc.relation.journal | Optimization Letters | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dc.date.updated | 2016-08-18T15:36:55Z | |
| dc.language.rfc3066 | en | |
| dc.rights.holder | Springer-Verlag Berlin Heidelberg | |
| dspace.orderedauthors | Vũ, Bằng Công | en_US |
| dspace.embargo.terms | N | en |
| mit.license | PUBLISHER_POLICY | en_US |
