{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:14:11Z","timestamp":1771028051709,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T00:00:00Z","timestamp":1548374400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T00:00:00Z","timestamp":1548374400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1447449"],"award-info":[{"award-number":["IIS-1447449"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1628384"],"award-info":[{"award-number":["1628384"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1634597"],"award-info":[{"award-number":["1634597"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1740707"],"award-info":[{"award-number":["1740707"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-13-1-0138"],"award-info":[{"award-number":["FA9550-13-1-0138"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006224","name":"Argonne National Laboratory","doi-asserted-by":"publisher","award":["Subcontract 3F-30222"],"award-info":[{"award-number":["Subcontract 3F-30222"]}],"id":[{"id":"10.13039\/100006224","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006224","name":"Argonne National Laboratory","doi-asserted-by":"publisher","award":["Subcontracts 8F-30039"],"award-info":[{"award-number":["Subcontracts 8F-30039"]}],"id":[{"id":"10.13039\/100006224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10589-019-00059-z","type":"journal-article","created":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T19:55:27Z","timestamp":1548446127000},"page":"641-674","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Inexact Successive quadratic approximation for regularized optimization"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2890-0866","authenticated-orcid":false,"given":"Ching-pei","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen J.","family":"Wright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,25]]},"reference":[{"issue":"1","key":"59_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1137\/130941961","volume":"25","author":"F Bach","year":"2015","unstructured":"Bach, F.: Duality between subgradient and conditional gradient methods. SIAM J. Optim. 25(1), 115\u2013129 (2015)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"59_CR2","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1137\/15M1019325","volume":"26","author":"S Bonettini","year":"2016","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M.: Variable metric inexact line-search-based methods for nonsmooth optimization. SIAM J. Optim. 26(2), 891\u2013921 (2016)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"59_CR3","doi-asserted-by":"publisher","first-page":"055005","DOI":"10.1088\/1361-6420\/aa5bfd","volume":"33","author":"S Bonettini","year":"2017","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M., Rebegoldi, S.: On the convergence of a linesearch based proximal-gradient method for nonconvex optimization. Inverse Problems 33(5), 055005 (2017)","journal-title":"Inverse Problems"},{"issue":"1\u20133","key":"59_CR4","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01580867","volume":"47","author":"JV Burke","year":"1990","unstructured":"Burke, J.V., Mor\u00e9, J.J., Toraldo, G.: Convergence properties of trust region methods for linear and convex constraints. Math. Program. 47(1\u20133), 305\u2013336 (1990)","journal-title":"Math. Program."},{"key":"59_CR5","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"RH Byrd","year":"1995","unstructured":"Byrd, R.H., Lu, P., Nocedal, J., Zhu, C.: A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16, 1190\u20131208 (1995)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"59_CR6","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10107-015-0941-y","volume":"157","author":"RH Byrd","year":"2016","unstructured":"Byrd, R.H., Nocedal, J., Oztoprak, F.: An inexact successive quadratic approximation method for $${L}-1$$ regularized optimization. Math. Program. 157(2), 375\u2013396 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"59_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10957-013-0465-7","volume":"162","author":"E Chouzenoux","year":"2014","unstructured":"Chouzenoux, E., Pesquet, J.C., Repetti, A.: Variable metric forward\u2013backward algorithm for minimizing the sum of a differentiable function and a convex function. J. Optim. Theory Appl. 162(1), 107\u2013132 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"59_CR8","doi-asserted-by":"publisher","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\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"issue":"2","key":"59_CR9","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/0725029","volume":"25","author":"AR Conn","year":"1988","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 25(2), 433\u2013460 (1988)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"59_CR10","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1287\/moor.2017.0889","volume":"43","author":"D Drusvyatskiy","year":"2005","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Error bounds, quadratic growth, and linear convergence of proximal methods. Math. Oper. Res. 43(3), 919\u2013948 (2005)","journal-title":"Math. Oper. Res."},{"key":"59_CR11","volume-title":"Practical Methods of Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization. Wiley, Hoboken (1987)"},{"issue":"3","key":"59_CR12","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10589-017-9964-z","volume":"69","author":"H Ghanbari","year":"2018","unstructured":"Ghanbari, H., Scheinberg, K.: Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates. Comput. Optim. Appl. 69(3), 597\u2013627 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"59_CR13","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1137\/110847081","volume":"22","author":"K Jiang","year":"2012","unstructured":"Jiang, K., Sun, D., Toh, K.C.: An inexact accelerated proximal gradient method for large scale linearly constrained convex sdp. SIAM J. Optim. 22(3), 1042\u20131064 (2012)","journal-title":"SIAM J. Optim."},{"key":"59_CR14","unstructured":"Lee, C.P., Chang, K.W.: Distributed block-diagonal approximation methods for regularized empirical risk minimization. Tech. rep. (2017)"},{"key":"59_CR15","doi-asserted-by":"crossref","unstructured":"Lee, C.p., Lim, C.H., Wright, S.J.: A distributed quasi-Newton algorithm for empirical risk minimization with nonsmooth regularization. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1646\u20131655. ACM, New York (2018)","DOI":"10.1145\/3219819.3220075"},{"key":"59_CR16","unstructured":"Lee, C.P., Roth, D.: Distributed box-constrained quadratic optimization for dual linear SVM. In: Proceedings of the International Conference on Machine Learning (2015)"},{"issue":"3","key":"59_CR17","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/130921428","volume":"24","author":"JD Lee","year":"2014","unstructured":"Lee, J.D., Sun, Y., Saunders, M.A.: Proximal Newton-type methods for minimizing composite functions. SIAM J. Optim. 24(3), 1420\u20131443 (2014)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"59_CR18","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/S1052623499354242","volume":"11","author":"DH Li","year":"2001","unstructured":"Li, D.H., Fukushima, M.: On the global convergence of the BFGS method for nonconvex unconstrained optimization problems. SIAM J. Optim. 11(4), 1054\u20131064 (2001)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"59_CR19","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00186-016-0566-9","volume":"85","author":"J Li","year":"2017","unstructured":"Li, J., Andersen, M.S., Vandenberghe, L.: Inexact proximal Newton methods for self-concordant functions. Math. Methods Oper. Res. 85(1), 19\u201341 (2017)","journal-title":"Math. Methods Oper. Res."},{"key":"59_CR20","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/S1052623498345075","volume":"9","author":"CJ Lin","year":"1999","unstructured":"Lin, C.J., Mor\u00e9, J.J.: Newton\u2019s method for large-scale bound constrained problems. SIAM J. Optim. 9, 1100\u20131127 (1999)","journal-title":"SIAM J. Optim."},{"issue":"212","key":"59_CR21","first-page":"1","volume":"18","author":"H Lin","year":"2018","unstructured":"Lin, H., Mairal, J., Harchaoui, Z.: Catalyst acceleration for first-order convex optimization: from theory to practice. J. Mach. Learn. Res. 18(212), 1\u201354 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"59_CR22","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45(1), 503\u2013528 (1989)","journal-title":"Math. Program."},{"issue":"3","key":"59_CR23","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4(3), 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"59_CR24","doi-asserted-by":"publisher","unstructured":"Necoara, I., Nesterov, Yu., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. (2018). \n                    https:\/\/doi.org\/10.1007\/s10107-018-1232-1","DOI":"10.1007\/s10107-018-1232-1"},{"key":"59_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Dordrecht (2004)"},{"issue":"1","key":"59_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"59_CR27","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"59_CR28","unstructured":"Rodomanov, A., Kropotov, D.: A superlinearly-convergent proximal Newton-type method for the optimization of finite sums. In: Proceedings of the International Conference on Machine Learning, pp. 2597\u20132605 (2016)"},{"issue":"1\u20132","key":"59_CR29","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10107-016-0997-3","volume":"160","author":"K Scheinberg","year":"2016","unstructured":"Scheinberg, K., Tang, X.: Practical inexact proximal quasi-Newton method with global complexity analysis. Math. Program. 160(1\u20132), 495\u2013529 (2016)","journal-title":"Math. Program."},{"key":"59_CR30","unstructured":"Schmidt, M., Roux, N., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Advances in Neural Information Processing Systems, pp. 1458\u20131466 (2011)"},{"issue":"4","key":"59_CR31","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1137\/130944539","volume":"24","author":"Q Tran-Dinh","year":"2014","unstructured":"Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: An inexact proximal path-following algorithm for constrained convex minimization. SIAM J. Optim. 24(4), 1718\u20131745 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"59_CR32","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117(1), 387\u2013423 (2009)","journal-title":"Math. Program."},{"issue":"3","key":"59_CR33","doi-asserted-by":"publisher","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":"59_CR34","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57, 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"59_CR35","unstructured":"Yang, T.: Trading computation for communication: Distributed stochastic dual coordinate ascent. In: Advances in Neural Information Processing Systems, pp. 629\u2013637 (2013)"},{"issue":"115","key":"59_CR36","first-page":"1","volume":"18","author":"S Zheng","year":"2017","unstructured":"Zheng, S., Wang, J., Xia, F., Xu, W., Zhang, T.: A general distributed dual coordinate optimization framework for regularized loss minimization. J. Mach. Learn. Res. 18(115), 1\u201352 (2017)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00059-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00059-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00059-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T11:02:49Z","timestamp":1589713369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00059-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,25]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["59"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00059-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,25]]},"assertion":[{"value":"3 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}