{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T19:14:08Z","timestamp":1772046848789,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:00:00Z","timestamp":1553212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:00:00Z","timestamp":1553212800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-14-1-0500"],"award-info":[{"award-number":["FA9550-14-1-0500"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10107-019-01382-3","type":"journal-article","created":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T10:03:59Z","timestamp":1553249039000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["The multiproximal linearization method for convex composite problems"],"prefix":"10.1007","volume":"182","author":[{"given":"J\u00e9r\u00f4me","family":"Bolte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3573-1546","authenticated-orcid":false,"given":"Zheng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edouard","family":"Pauwels","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,22]]},"reference":[{"issue":"3","key":"1382_CR1","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16(3), 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"1382_CR2","doi-asserted-by":"crossref","first-page":"3232","DOI":"10.1137\/090763317","volume":"20","author":"A Auslender","year":"2010","unstructured":"Auslender, A., Shefi, R., Teboulle, M.: A moving balls approximation method for a class of smooth constrained minimization problems. SIAM J. Optim. 20(6), 3232\u20133259 (2010)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1382_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10957-012-0145-z","volume":"156","author":"A Auslender","year":"2013","unstructured":"Auslender, A.: An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming. J. Optim. Theory Appl. 156(2), 183\u2013212 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"1382_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2017)"},{"issue":"1","key":"1382_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck A","year":"2009","unstructured":"Beck A, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"1382_CR6","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1287\/moor.2015.0735","volume":"41","author":"J Bolte","year":"2016","unstructured":"Bolte, J., Pauwels, E.: Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs. Math. Oper. Res. 41(2), 442\u2013465 (2016)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1382_CR7","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/BF01584377","volume":"33","author":"JV Burke","year":"1985","unstructured":"Burke, J.V.: Descent methods for composite nondifferentiable optimization problems. Math. Program. 33(3), 260\u2013279 (1985)","journal-title":"Math. Program."},{"issue":"2","key":"1382_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01585997","volume":"71","author":"JV Burke","year":"1995","unstructured":"Burke, J.V., Ferris, M.C.: A Gauss\u2013Newton method for convex composite optimization. Math. Program. 71(2), 179\u2013194 (1995)","journal-title":"Math. Program."},{"issue":"4","key":"1382_CR9","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1137\/11082381X","volume":"21","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming. SIAM J. Optim. 21(4), 1721\u20131739 (2011)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1382_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10107-012-0617-9","volume":"144","author":"C Cartis","year":"2014","unstructured":"Cartis, C., Gould, N., Toint, P.: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 144(1), 93\u2013106 (2014)","journal-title":"Math. Program."},{"issue":"4","key":"1382_CR11","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward\u2013backward splitting. Multiscale Model. Simul. 4(4), 1168\u20132000 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"1382_CR12","first-page":"185","volume-title":"Proximal Splitting Methods in Signal Processing, Fixed-Point Algorithm for Inverse Problems in Science and Engineering. Optimization and Its Applications","author":"PL Combettes","year":"2011","unstructured":"Combettes, P.L., Pesquet, J.-C.: Proximal Splitting Methods in Signal Processing, Fixed-Point Algorithm for Inverse Problems in Science and Engineering. Optimization and Its Applications, pp. 185\u2013212. Springer, New York (2011)"},{"issue":"4","key":"1382_CR13","doi-asserted-by":"crossref","first-page":"2420","DOI":"10.1137\/130904160","volume":"23","author":"PL Combettes","year":"2013","unstructured":"Combettes, P.L.: Systems of structured monotone inclusions: duality, algorithms, and applications. SIAM J. Optim. 23(4), 2420\u20132447 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1382_CR14","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10107-016-1044-0","volume":"168","author":"PL Combettes","year":"2018","unstructured":"Combettes, P.L., Eckstein, J.: Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions. Math. Program. 168(1\u20132), 645\u2013672 (2018). \nhttps:\/\/doi.org\/10.1007\/s10107-016-1044-0","journal-title":"Math. Program."},{"issue":"3","key":"1382_CR15","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1287\/moor.2017.0889","volume":"43","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Error bounds, quadratic growth, and linear convergence of proximal methods. Math. Op. Res. 43(3), 919\u2013948 (2018). \nhttps:\/\/doi.org\/10.1287\/moor.2017.0889","journal-title":"Math. Op. Res."},{"key":"1382_CR16","doi-asserted-by":"publisher","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency of minimizing compositions of convex functions and smooth maps. Math. Program. (2018). \nhttps:\/\/doi.org\/10.1007\/s10107-018-1311-3","DOI":"10.1007\/s10107-018-1311-3"},{"issue":"1","key":"1382_CR17","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1287\/moor.18.1.202","volume":"18","author":"J Eckstein","year":"1993","unstructured":"Eckstein, J.: Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming. Math. Oper. Res. 18(1), 202\u2013226 (1993)","journal-title":"Math. Oper. Res."},{"key":"1382_CR18","doi-asserted-by":"crossref","unstructured":"Fletcher, R.: A model algorithm for composite nondifferentiable optimization problems. In: Sorensen, D.C., Wets, R.J.B. (eds.) Nondifferential and Variational Techniques in Optimization. Mathematical Programming Studies, vol. 17. Springer, Berlin, Heidelberg (1982)","DOI":"10.1007\/BFb0120959"},{"key":"1382_CR19","volume-title":"Convex Analysis and Minimization Algorithm I","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemarechal, C.: Convex Analysis and Minimization Algorithm I. Springer, New York (1993)"},{"key":"1382_CR20","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.B.: A note on the Legendre\u2013Fenchel transform of convex composite functions. In: Alart, P., Maisonneuve, O., Rockafellar R.T. (eds.) Nonsmooth Mechanics and Analysis, pp. 35\u201346. Springer US (2006)","DOI":"10.1007\/0-387-29195-4_4"},{"key":"1382_CR21","first-page":"2663","volume":"25","author":"N Le Roux","year":"2012","unstructured":"Le Roux, N., Schmidt, M., Bach, F.: A stochastic gradient method with an exponential convergence rate for finite training sets. Adv. Neural Inf. Process. Syst. 25, 2663\u20132671 (2012)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"5","key":"1382_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"ES Levitin","year":"1966","unstructured":"Levitin, E.S., Polyak, B.T.: Constrained minimization methods. USSR Comput. Math. Math. Phys. 6(5), 1\u201350 (1966)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1\u20132","key":"1382_CR23","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10107-015-0943-9","volume":"158","author":"AS Lewis","year":"2016","unstructured":"Lewis, A.S., Wright, S.J.: A proximal method for composite minimization. Mathe. Program. Math. Program. 158(1\u20132), 501\u2013546 (2016). \nhttps:\/\/doi.org\/10.1007\/s10107-015-0943-9","journal-title":"Mathe. Program. Math. Program."},{"issue":"2","key":"1382_CR24","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1137\/06065622X","volume":"18","author":"C Li","year":"2007","unstructured":"Li, C., Ng, K.F.: Majorizing functions and convergence of the Gauss\u2013Newton method for convex composite optimization. SIAM J. Optim. 18(2), 613\u2013642 (2007)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1382_CR25","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s101070100249","volume":"91","author":"C Li","year":"2002","unstructured":"Li, C., Wang, X.: On convergence of the Gauss\u2013Newton method for convex composite optimization. Math. Program. 91(2), 349\u2013356 (2002)","journal-title":"Math. Program."},{"issue":"6","key":"1382_CR26","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"P-L Lions","year":"1979","unstructured":"Lions, P.-L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16(6), 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"1382_CR27","unstructured":"Lofberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB. In: IEEE International Symposium on Computer Aided Control Systems Design (2004)"},{"issue":"3","key":"1382_CR28","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: Revue fran\u00e7aise d\u2019informatique et de recherche op\u00e9rationnelle, s\u00e9rie rouge. Br\u00e8ve communication. R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives 4(3), 154\u2013158 (1970)","journal-title":"Br\u00e8ve communication. R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives"},{"key":"1382_CR29","doi-asserted-by":"crossref","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"J-J Moreau","year":"1965","unstructured":"Moreau, J.-J.: Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bulletin de la Soci\u00e9t\u00e9 math\u00e9matique de France. 93, 273\u2013299 (1965)","journal-title":"Bulletin de la Soci\u00e9t\u00e9 math\u00e9matique de France."},{"issue":"3","key":"1382_CR30","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0022-0396(77)90085-7","volume":"26","author":"J-J Moreau","year":"1977","unstructured":"Moreau, J.-J.: Evolution problem associated with a moving convex set in a Hilbert space. J. Differ. Equ. 26(3), 347\u2013374 (1977)","journal-title":"J. Differ. Equ."},{"key":"1382_CR31","unstructured":"Mosek Aps: The MOSEK optimization toolbox for MATLAB manual. Version 7, 1 (2016). \nhttps:\/\/HrBwww.yumpu.com\/en\/document\/view\/54768342\/the-mosek-optimization-toolbox-for-matlab-manuaHrBl-version-70-revision-141\/32"},{"key":"1382_CR32","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics, Philadelphia (1994)"},{"key":"1382_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Programming, Volumne I: Basis Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Programming, Volumne I: Basis Course. Springer, New York (2004)"},{"key":"1382_CR34","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A Nemirovskii","year":"1983","unstructured":"Nemirovskii, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)"},{"key":"1382_CR35","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, New York (2006)"},{"key":"1382_CR36","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719468","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"2000","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. SIAM, Philadelphia (2000)"},{"issue":"2","key":"1382_CR37","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0022-247X(79)90234-8","volume":"72","author":"GB Passty","year":"1979","unstructured":"Passty, G.B.: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space. J. Math. Anal. Appl. 72(2), 383\u2013390 (1979)","journal-title":"J. Math. Anal. Appl."},{"issue":"6","key":"1382_CR38","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1016\/j.orl.2016.10.003","volume":"44","author":"E Pauwels","year":"2016","unstructured":"Pauwels, E.: The value function approach to convergence analysis in composite optimization. Oper. Res. Lett. 44(6), 790\u2013795 (2016)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1382_CR39","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1080\/02331938708843231","volume":"18","author":"BN Pshenichnyi","year":"1987","unstructured":"Pshenichnyi, B.N.: The linearization method. Optimization 18(2), 179\u2013196 (1987)","journal-title":"Optimization"},{"issue":"2","key":"1382_CR40","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"1382_CR41","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.: Variational Analysis. Springer, New York (1998)"},{"issue":"1","key":"1382_CR42","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0108011","volume":"8","author":"JB Rosen","year":"1960","unstructured":"Rosen, J.B.: The gradient projection method for nonlinear programming. Part I. Linear constraints. J. Soc. Ind. Appl. Math. 8(1), 181\u2013217 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"4","key":"1382_CR43","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/0109044","volume":"9","author":"JB Rosen","year":"1961","unstructured":"Rosen, J.B.: The gradient projection method for nonlinear programming. Part II. Nonlinear constraints. J. Soc. Ind. Appl. Math. 9(4), 514\u2013532 (1961)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"2","key":"1382_CR44","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/s10589-012-9476-9","volume":"53","author":"S Salzo","year":"2012","unstructured":"Salzo, S., Villa, S.: Convergence analysis of a proximal Gauss\u2013Newton method. Comput. Optim. Appl. 53(2), 557\u2013589 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"1382_CR45","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162(1\u20132), 83\u2013112 (2017)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1382_CR46","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10107-015-0952-8","volume":"159","author":"R Shefi","year":"2016","unstructured":"Shefi, R., Teboulle, M.: A dual method for minimizing a nonsmooth objective over one smooth inequality constraint. Math. Program. 159(1\u20132), 137\u2013164 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"1382_CR47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-007-0180-y","volume":"118","author":"Solodov","year":"2009","unstructured":"Solodov, : Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences. Math. Program. 118(1), 1\u201312 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"1382_CR48","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0329006","volume":"29","author":"P Tseng","year":"1991","unstructured":"Tseng, P.: Applications of a splitting algorithm to decomposition in convex programming and variational inequalities. SIAM J. Control Optim. 29(1), 119\u2013138 (1991)","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"1382_CR49","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1137\/110844805","volume":"23","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward\u2013backward algorithms. SIAM J. Optim. 23(3), 1607\u20131633 (2013)","journal-title":"SIAM J. Optim."},{"key":"1382_CR50","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"Y Ye","year":"1997","unstructured":"Ye, Y.: Interior Point Algorithms: Theory and Analysis. Yinyu Ye Wiley & Sons, New York (1997)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01382-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01382-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01382-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T15:13:25Z","timestamp":1592925205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01382-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,22]]},"references-count":50,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["1382"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01382-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,22]]},"assertion":[{"value":"2 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}