{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T01:27:08Z","timestamp":1790386028155,"version":"4.1.0"},"reference-count":45,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","funder":[{"DOI":"10.13039\/501100008736","name":"Fondo de Fomento al Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["11140360"],"award-info":[{"award-number":["11140360"]}],"id":[{"id":"10.13039\/501100008736","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-0707424"],"award-info":[{"award-number":["DGE-0707424"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005853","name":"Universidad de Chile","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005853","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Tseng's algorithm finds a zero of the sum of a maximally monotone operator and a monotone continuous operator by evaluating the latter twice per iteration. In this paper, we modify Tseng's algorithm for finding a zero of the sum of three operators, where we add a cocoercive operator to the inclusion. Since the sum of a cocoercive and a monotone-Lipschitz operator is monotone and Lipschitz, we could use Tseng's method for solving this problem, but implementing both operators twice per iteration and without taking into advantage the cocoercivity property of one operator. Instead, in our approach, although the continuous monotone operator must still be evaluated twice, we exploit the cocoercivity of one operator by evaluating it only once per iteration. Moreover, when the cocoercive or continuous-monotone operators are zero it reduces to Tseng's algorithm or forward-backward splittings, respectively, unifying in this way both algorithms. In addition, we provide a preconditioned version of the proposed method including non-self-adjoint linear operators in the computation of resolvents and the single-valued operators involved. This approach allows us to also extend previous variable metric versions of the Tseng and forward-backward methods and simplify their conditions on the underlying metrics. We also exploit the case in which non-self-adjoint linear operators are triangular by blocks in the primal-dual product space for solving primal-dual composite monotone inclusions, obtaining Gauss--Seidel-type algorithms which generalize several primal-dual methods available in the literature. Finally we explore applications to the obstacle problem, empirical risk minimization, distributed optimization, and nonlinear programming and we illustrate the performance of the method via some numerical simulations.<\/jats:p>","DOI":"10.1137\/17m1120099","type":"journal-article","created":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T11:56:19Z","timestamp":1538654179000},"page":"2839-2871","source":"Crossref","is-referenced-by-count":70,"title":["Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions"],"prefix":"10.1137","volume":"28","author":[{"given":"Luis M.","family":"Bricen\u0342o-Arias","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damek","family":"Davis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,10,4]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03007664"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2012.09.003"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"H. H. Bauschke and P. L. Combettes,\n                      Convex Analysis and Monotone Operator Theory in Hilbert Spaces\n                      , 2nd ed., Springer, New York, 2017.","DOI":"10.1007\/978-3-319-48311-5"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2016.1214959"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0472-0"},{"key":"atypb6","unstructured":"D. P. Bertsekas,\n                      Incremental Aggregated Proximal and Augmented Lagrangian Algorithms\n                      , preprint,https:\/\/arxiv.org\/abs\/1509.09257, 2015."},{"key":"atypb7","first-page":"1","author":"Bianchi P.","year":"2015","journal-title":"NJ"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1137\/10081602X"},{"key":"atypb9","unstructured":"L. M. Bricen\u0342o-Arias, D. Kalise, and F. J. Silva,\n                      Proximal Methods for Stationary Mean Field Games with Local Couplings\n                      , preprint,https:\/\/arxiv.org\/abs\/1608.07701, 2017."},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1975-13874-2"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02498216"},{"key":"atypb12","unstructured":"L. A. Caffarelli,\n                      The Obstacle Problem\n                      , Lezioni Fermiane, Publications of the Scuola Normale Superiore, Scuola Normale Superiore, Pisa, 1999."},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"atypb14","unstructured":"F. R. K. Chung,\n                      Spectral Graph Theory\n                      , CBMS Reg. Conf. Ser. Math. 92, American Mathematical Society, Providence, RI, 1997."},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-579X(01)80010-0"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1080\/02331930412331327157"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-011-0191-y"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1016\/j.na.2012.09.008"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2012.733883"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1137\/050626090"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-012-0245-9"},{"key":"atypb22","unstructured":"D. Davis,\n                      Convergence Rate Analysis of Primal-Dual Splitting Schemes\n                      , preprint, arXiv:1408.4419, 2014."},{"key":"atypb23","first-page":"1646","author":"Defazio A.","year":"2014","journal-title":"NY"},{"key":"atypb24","first-page":"1125","volume":"32","author":"Defazio A.","year":"2014","journal-title":"Proc. Mach. Learn. Res."},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1964-11178-2"},{"key":"atypb26","unstructured":"P. Grisvard,\n                      Elliptic Problems in Nonsmooth Domains\n                      , Pitman, Boston, MA, 1985."},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1137\/100814494"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2014.03.062"},{"key":"atypb29","first-page":"315","author":"Johnson R.","year":"2013","journal-title":"NY"},{"key":"atypb30","doi-asserted-by":"crossref","unstructured":"P. Latafat and P. Patrinos,\n                      Asymmetric Forward-Backward-Adjoint Splitting for Solving Monotone Inclusions Involving Three Operators\n                      , preprint, arXiv:1602.08729, 2016.","DOI":"10.1007\/s10589-017-9909-6"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.821992"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1137\/0716071"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499362111"},{"key":"atypb34","first-page":"241","author":"Rockafellar R. T.","year":"1970","journal-title":"RI"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1137\/16M1073741"},{"key":"atypb36","unstructured":"M. Schmidt, N. L. Roux, and F. Bach,\n                      Minimizing Finite Sums with the Stochastic Average Gradient\n                      , preprint,https:\/\/arxiv.org\/abs\/1309.2388, 2013."},{"key":"atypb37","doi-asserted-by":"crossref","unstructured":"S. Shalev-Shwartz and S. Ben-David,\n                      Understanding Machine Learning: From Theory to Algorithms\n                      , Cambridge University Press, New York, 2014.","DOI":"10.1017\/CBO9781107298019"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2461520"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012998338806"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1080\/01630563.2013.763825"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-011-9254-8"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1137\/130931278"},{"key":"atypb44","doi-asserted-by":"crossref","unstructured":"C. Z\u0103linescu,\n                      Convex Analysis in General Vector Spaces\n                      , World Scientific, River Edge, NJ, 2002.","DOI":"10.1142\/5021"},{"key":"atypb45","doi-asserted-by":"crossref","unstructured":"E. Zeidler,\n                      Nonlinear Functional Analysis and Its Applications II\/B: Nonlinear Monotone Operators\n                      , Springer, New York, 1990.","DOI":"10.1007\/978-1-4612-0981-2"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1120099","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:51:54Z","timestamp":1787338314000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1120099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1120099"],"URL":"https:\/\/doi.org\/10.1137\/17m1120099","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}