{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T08:44:14Z","timestamp":1772700254767,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:00:00Z","timestamp":1490227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:00:00Z","timestamp":1490227200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000888","name":"W.M. Keck Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000888","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005595","name":"University of California","doi-asserted-by":"publisher","award":["Lab Fees grant"],"award-info":[{"award-number":["Lab Fees grant"]}],"id":[{"id":"10.13039\/100005595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-14-0444"],"award-info":[{"award-number":["N00014-14-0444"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10915-017-0420-0","type":"journal-article","created":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T03:50:30Z","timestamp":1490327430000},"page":"416-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An Efficient Primal-Dual Method for the Obstacle Problem"],"prefix":"10.1007","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5685-4273","authenticated-orcid":false,"given":"Dominique","family":"Zosso","sequence":"first","affiliation":[]},{"given":"Braxton","family":"Osting","sequence":"additional","affiliation":[]},{"given":"Mandy(Mengqi)","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Stanley J.","family":"Osher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,23]]},"reference":[{"key":"420_CR1","volume-title":"Studies in Linear and Non-Linear Programming","author":"KJ Arrow","year":"1958","unstructured":"Arrow, K.J., Hurwicz, L., Uzawa, H.: Studies in Linear and Non-Linear Programming. Cambridge Univ Press, Cambridge (1958)"},{"key":"420_CR2","volume-title":"Variational Analysis in Sobolev and BV Spaces: Applications to PDEs and Optimization","year":"2014","unstructured":"Attouch, H., Buttazzo, G., Michaille, G. (eds.): Variational Analysis in Sobolev and BV Spaces: Applications to PDEs and Optimization, 2nd edn. SIAM, Philadelphia, PA (2014)","edition":"2"},{"issue":"11","key":"420_CR3","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TIP.2009.2028250","volume":"18","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems. IEEE Trans. Image Process. 18(11), 2419\u20132434 (2009). doi:\n                    10.1109\/TIP.2009.2028250","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"420_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0893-6080(03)00170-9","volume":"17","author":"A Bhaya","year":"2004","unstructured":"Bhaya, A., Kaszkurewicz, E.: Steepest descent with momentum for quadratic functions is a version of the conjugate gradient method. Neural Netw. Off. J. Int. Neural Netw. Soc. 17(1), 65\u201371 (2004). doi:\n                    10.1016\/S0893-6080(03)00170-9","journal-title":"Neural Netw. Off. J. Int. Neural Netw. Soc."},{"issue":"3","key":"420_CR5","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s00211-007-0098-6","volume":"107","author":"D Braess","year":"2007","unstructured":"Braess, D., Carstensen, C., Hoppe, R.H.W.: Convergence analysis of a conforming adaptive finite element method for an obstacle problem. Numer. Math. 107(3), 455\u2013471 (2007). doi:\n                    10.1007\/s00211-007-0098-6","journal-title":"Numer. Math."},{"issue":"1","key":"420_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF00281564","volume":"28","author":"H Brezis","year":"1968","unstructured":"Brezis, H., Sibony, M.: M\u00e9thodes d\u2019approximation et d\u2019it\u00e9ration pour les op\u00e9rateurs monotones. Arch. Ration. Mech. Anal. 28(1), 59\u201382 (1968). doi:\n                    10.1007\/BF00281564","journal-title":"Arch. Ration. Mech. Anal."},{"issue":"4\u20135","key":"420_CR7","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF02498216","volume":"4","author":"LA Caffarelli","year":"1998","unstructured":"Caffarelli, L.A.: The obstacle problem revisited. J. Fourier Anal. Appl. 4(4\u20135), 383\u2013402 (1998). doi:\n                    10.1007\/BF02498216","journal-title":"J. Fourier Anal. Appl."},{"issue":"1","key":"420_CR8","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vision 40(1), 120\u2013145 (2011). doi:\n                    10.1007\/s10851-010-0251-1","journal-title":"J. Math. Imaging Vision"},{"issue":"4","key":"420_CR9","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1137\/09076934X","volume":"3","author":"E Esser","year":"2010","unstructured":"Esser, E., Zhang, X., Chan, T.F.: A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science. SIAM J. Imaging Sci. 3(4), 1015\u20131046 (2010). doi:\n                    10.1137\/09076934X","journal-title":"SIAM J. Imaging Sci."},{"key":"420_CR10","volume-title":"Variational Principles and Free-Boundary Problems","author":"A Friedmann","year":"1982","unstructured":"Friedmann, A.: Variational Principles and Free-Boundary Problems. Wiley, New York (1982)"},{"key":"420_CR11","volume-title":"Numerical methods for nonlinear variational problems","author":"R Glowinski","year":"2013","unstructured":"Glowinski, R.: Numerical methods for nonlinear variational problems. Springer Science & Business Media, Berlin (2013)"},{"issue":"3","key":"420_CR12","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/S1052623401383558","volume":"13","author":"M Hinterm\u00fcller","year":"2002","unstructured":"Hinterm\u00fcller, M., Ito, K., Kunisch, K.: The primal-dual active set strategy as a semismooth newton method. SIAM J. Optim. 13(3), 865\u2013888 (2002). doi:\n                    10.1137\/S1052623401383558","journal-title":"SIAM J. Optim."},{"issue":"2","key":"420_CR13","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1137\/10078299","volume":"21","author":"M Hinterm\u00fcller","year":"2011","unstructured":"Hinterm\u00fcller, M., Kovtunenko, V.A., Kunisch, K.: Obstacle problems with cohesion: a hemivariational inequality approach and its efficient numerical solution. SIAM J. Optim. 21(2), 491\u2013516 (2011). doi:\n                    10.1137\/10078299","journal-title":"SIAM J. Optim."},{"issue":"5","key":"420_CR14","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1137\/0724069","volume":"24","author":"RHW Hoppe","year":"1987","unstructured":"Hoppe, R.H.W.: Multigrid algorithms for variational inequalities. SIAM J. Numer. Anal. 24(5), 1046\u20131065 (1987). doi:\n                    10.1137\/0724069","journal-title":"SIAM J. Numer. Anal."},{"issue":"04","key":"420_CR15","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1142\/S0218202592000284","volume":"02","author":"C Johnson","year":"1992","unstructured":"Johnson, C.: Adaptive finite element methods for the obstacle problem. Math. Model Method Appl. Sci. 02(04), 483\u2013487 (1992). doi:\n                    10.1142\/S0218202592000284","journal-title":"Math. Model Method Appl. Sci."},{"issue":"6","key":"420_CR16","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL 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."},{"issue":"2","key":"420_CR17","first-page":"157","volume":"1","author":"K Majava","year":"2004","unstructured":"Majava, K., Tai, X.C.: A level set method for solving free boundary problems associated with obstacles. Int. J. Numer. Anal. Model. 1(2), 157\u2013171 (2004)","journal-title":"Int. J. Numer. Anal. Model."},{"issue":"2","key":"420_CR18","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$O(1\/k^2)$$. Sov. Math. Dokl. 27(2), 372\u2013376 (1983)","journal-title":"Sov. Math. Dokl."},{"issue":"5","key":"420_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964). doi:\n                    10.1016\/0041-5553(64)90137-5","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"420_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0893-6080(98)00116-6","volume":"12","author":"N Qian","year":"1999","unstructured":"Qian, N.: On the momentum term in gradient descent learning algorithms. Neural Netw. 12(1), 145\u2013151 (1999). doi:\n                    10.1016\/S0893-6080(98)00116-6","journal-title":"Neural Netw."},{"key":"420_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970524","author":"RT Rockafellar","year":"1974","unstructured":"Rockafellar, R.T.: Conjugate duality and optimization. Soc. Ind. Appl. Math. (1974). doi:\n                    10.1137\/1.9781611970524","journal-title":"Soc. Ind. Appl. Math."},{"key":"420_CR22","volume-title":"Obstacle Problems in Mathematical Physics","author":"JF Rodrigues","year":"1987","unstructured":"Rodrigues, J.F.: Obstacle Problems in Mathematical Physics. Elsevier Science Publishers, Amsterdam (1987)"},{"issue":"4","key":"420_CR23","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF02243774","volume":"32","author":"R Scholz","year":"1984","unstructured":"Scholz, R.: Numerical solution of the obstacle problem by the penalty method. Computing 32(4), 297\u2013306 (1984). doi:\n                    10.1007\/BF02243774","journal-title":"Computing"},{"issue":"3","key":"420_CR24","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/83.661181","volume":"7","author":"N Sochen","year":"1998","unstructured":"Sochen, N., Kimmel, R., Malladi, R.: A general framework for low level vision. IEEE Trans. Image Process. 7(3), 310\u2013318 (1998)","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"420_CR25","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s002110200404","volume":"93","author":"XC Tai","year":"2003","unstructured":"Tai, X.C.: Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities. Numer. Math. 93(4), 755\u2013786 (2003). doi:\n                    10.1007\/s002110200404","journal-title":"Numer. Math."},{"issue":"4","key":"420_CR26","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1137\/140963303","volume":"75","author":"G Tran","year":"2015","unstructured":"Tran, G., Schaeffer, H., Feldman, W.M., Osher, S.J.: An $$L^1$$ penalty method for general obstacle problems. SIAM J. Appl. Math. 75(4), 1424\u20131444 (2015). doi:\n                    10.1137\/140963303","journal-title":"SIAM J. Appl. Math."},{"issue":"1\u20132","key":"420_CR27","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.amc.2007.12.015","volume":"201","author":"F Wang","year":"2008","unstructured":"Wang, F., Cheng, X.L.: An algorithm for solving the double obstacle problems. Appl. Math. Comput. 201(1\u20132), 221\u2013228 (2008). doi:\n                    10.1016\/j.amc.2007.12.015","journal-title":"Appl. Math. Comput."},{"issue":"12","key":"420_CR28","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1016\/S0898-1221(01)00115-8","volume":"41","author":"Y Zhang","year":"2001","unstructured":"Zhang, Y.: Multilevel projection algorithm for solving obstacle problems. Comput. Math. Appl. 41(12), 1505\u20131513 (2001). doi:\n                    10.1016\/S0898-1221(01)00115-8","journal-title":"Comput. Math. Appl."},{"key":"420_CR29","unstructured":"Zhu, M., Chan, T.: An efficient primal-dual hybrid gradient algorithm for total variation image restoration. Tech. Rep. UCLA CAM Rep. 08\u201334 (2008). \n                    http:\/\/www.math.ucla.edu\/applied\/cam\/\n                    \n                  \n                           \n                    ftp:\/\/ftp.math.ucla.edu\/pub\/camreport\/cam08-34.pdf"},{"issue":"3","key":"420_CR30","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10589-008-9225-2","volume":"47","author":"M Zhu","year":"2010","unstructured":"Zhu, M., Wright, S.J., Chan, T.F.: Duality-based algorithms for total-variation-regularized image restoration. Comput. Optim. Appl. 47(3), 377\u2013400 (2010). doi:\n                    10.1007\/s10589-008-9225-2","journal-title":"Comput. Optim. Appl."},{"key":"420_CR31","unstructured":"Zosso, D., Bustin, A.: A primal-dual projected gradient algorithm for efficient Beltrami regularization. Tech. Rep. UCLA CAM Rep. 14\u201352 (2014). \n                    http:\/\/www.math.ucla.edu\/applied\/cam\/\n                    \n                  \n                           \n                    ftp:\/\/ftp.math.ucla.edu\/pub\/camreport\/cam14-52.pdf"},{"issue":"4","key":"420_CR32","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.3934\/ipi.2016036","volume":"10","author":"D Zosso","year":"2016","unstructured":"Zosso, D., Osting, B.: A minimal surface criterion for graph partitioning. Inverse Probl. Imaging 10(4), 1149\u20131180 (2016). doi:\n                    10.3934\/ipi.2016036","journal-title":"Inverse Probl. Imaging"},{"key":"420_CR33","unstructured":"Zosso, D., Osting, B., Osher, S.J.: Elliptic PDE and primal-dual optimization methods. In Preparation (2015)"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10915-017-0420-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-017-0420-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-017-0420-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T09:17:20Z","timestamp":1589707040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10915-017-0420-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,23]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["420"],"URL":"https:\/\/doi.org\/10.1007\/s10915-017-0420-0","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,23]]},"assertion":[{"value":"1 November 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}