{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T21:18:14Z","timestamp":1774473494004,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,10,27]],"date-time":"2013-10-27T00:00:00Z","timestamp":1382832000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s12532-013-0061-8","type":"journal-article","created":{"date-parts":[[2013,10,26]],"date-time":"2013-10-26T08:10:39Z","timestamp":1382775039000},"page":"77-102","source":"Crossref","is-referenced-by-count":69,"title":["Block splitting for distributed optimization"],"prefix":"10.1007","volume":"6","author":[{"given":"Neal","family":"Parikh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Boyd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,27]]},"reference":[{"issue":"1","key":"61_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"61_CR2","volume-title":"Optimization by Vector Space Methods","author":"DG Luenberger","year":"1969","unstructured":"Luenberger, D.G.: Optimization by Vector Space Methods. Wiley, New York (1969)"},{"key":"61_CR3","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Methods in Convex Programming. Society for Industrial and Applied Mathematics (1994)","DOI":"10.1137\/1.9781611970791"},{"key":"61_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. Society for Industrial and Applied Mathematics (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"61_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"3","key":"61_CR6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Goldfarb, D., Yin, W.: Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. 2(3), 203\u2013230 (2010)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"61_CR7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"61_CR8","unstructured":"Group, I.M.R.T.C.W.: Intensity-modulated radiotherapy: Current status and issues of interest. Int. J. Radiat. Oncol. Biol. Phys. 51(4), 880\u2013914 (2001)"},{"key":"61_CR9","doi-asserted-by":"crossref","unstructured":"Webb, S.: Intensity-Modulated Radiation Therapy. Taylor & Francis (2001)","DOI":"10.1887\/0750306998"},{"key":"61_CR10","first-page":"2897","volume":"255","author":"JJ Moreau","year":"1962","unstructured":"Moreau, J.J.: Fonctions convexes duales et points proximaux dans un espace Hilbertien. Rep. Paris Acad. Sci. Ser. A 255, 2897\u20132899 (1962)","journal-title":"Rep. Paris Acad. Sci. Ser. A"},{"issue":"3","key":"61_CR11","first-page":"1","volume":"1","author":"N Parikh","year":"2013","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 1\u2013108 (2013). To appear","journal-title":"Found. Trends Optim."},{"issue":"2","key":"61_CR12","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1287\/ijoc.10.2.218","volume":"10","author":"J Eckstein","year":"1998","unstructured":"Eckstein, J., Ferris, M.C.: Operator-splitting methods for monotone affine variational inequalities, with a parallel application to optimal control. INFORMS J. Comput. 10(2), 218\u2013235 (1998)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"61_CR13","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang, J., Zhang, Y.: Alternating direction algorithms for $$\\backslash \\text{ ell }\\_1$$ \\ ell _ 1 -problems in compressive sensing. SIAM J. Sci. Comput. 33(1), 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"61_CR14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Ser. B (Statistical Methodology) 68(1), 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Ser. B (Statistical Methodology)"},{"issue":"6","key":"61_CR15","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1016\/j.automatica.2010.03.013","volume":"46","author":"H Ohlsson","year":"2010","unstructured":"Ohlsson, H., Ljung, L., Boyd, S.: Segmentation of ARX-models using sum-of-norms regularization. Automatica 46(6), 1107\u20131111 (2010)","journal-title":"Automatica"},{"key":"61_CR16","unstructured":"Agarwal, A., Chapelle, O., Dudik, M., Langford, J.: A reliable effective terascale linear learning, system. arXiv:1110.4198 (2011)"},{"key":"61_CR17","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming (2008). http:\/\/cvxr.com\/cvx"},{"issue":"1\u20134","key":"61_CR18","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J Sturm","year":"1999","unstructured":"Sturm, J.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1\u20134","key":"61_CR19","first-page":"545","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3: a MATLAB software package for semidefinite programming, version 1.3. Optim. Methods Softw. 11(1\u20134), 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"key":"61_CR20","unstructured":"CVX Research, I.: CVX: Matlab software for disciplined convex programming, version 2.0 beta. http:\/\/cvxr.com\/cvx\/examples (2012). Example library"},{"key":"61_CR21","doi-asserted-by":"crossref","unstructured":"Whaley, R.C., Dongarra, J.J.: Automatically tuned linear algebra software. In: Proceedings of the 1998 ACM\/IEEE Conference on Supercomputing (CDROM), pp. 1\u201327 (1998)","DOI":"10.1109\/SC.1998.10004"},{"issue":"1","key":"61_CR22","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0805005","volume":"5","author":"RJ Vanderbei","year":"1995","unstructured":"Vanderbei, R.J.: Symmetric quasi-definite matrices. SIAM J. Optim. 5(1), 100\u2013113 (1995)","journal-title":"SIAM J. Optim."},{"key":"61_CR23","unstructured":"Saunders, M.A.: Cholesky-based methods for sparse least squares: the benefits of regularization. In: Adams, L., Nazareth, J.L. (eds.) Linear and Nonlinear Conjugate Gradient-Related Methods, pp. 92\u2013100. SIAM, Philadelphia (1996)"},{"issue":"4","key":"61_CR24","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1145\/1114268.1114277","volume":"31","author":"TA Davis","year":"2005","unstructured":"Davis, T.A.: Algorithm 8xx: a concise sparse Cholesky factorization package. ACM Trans. Math. Softw. 31(4), 587\u2013591 (2005)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"61_CR25","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"P Amestoy","year":"1996","unstructured":"Amestoy, P., Davis, T.A., Duff, I.S.: An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17(4), 886\u2013905 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"61_CR26","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/1024074.1024081","volume":"30","author":"P Amestoy","year":"2004","unstructured":"Amestoy, P., Davis, T.A., Duff, I.S.: Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3), 381\u2013388 (2004)","journal-title":"ACM Trans. Math. Softw."},{"key":"61_CR27","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718881","volume-title":"Direct Methods for Sparse Linear Systems","author":"TA Davis","year":"2006","unstructured":"Davis, T.A.: Direct Methods for Sparse Linear Systems. SIAM, Philadelphia (2006)"},{"issue":"5","key":"61_CR28","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1137\/S1064827594271421","volume":"17","author":"M Benzi","year":"1996","unstructured":"Benzi, M., Meyer, C.D., Tuma, M.: A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM J. Sci. Comput. 17(5), 1135\u20131149 (1996)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"61_CR29","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1006\/jcph.2002.7176","volume":"182","author":"M Benzi","year":"2002","unstructured":"Benzi, M.: Preconditioning techniques for large linear systems: a survey. J. Comput. Phys. 182(2), 418\u2013477 (2002)","journal-title":"J. Comput. Phys."},{"key":"61_CR30","volume-title":"Matrix Computations, vol. 3","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.: Matrix Computations, vol. 3. Johns Hopkins University Press, Baltimore (1996)"},{"key":"61_CR31","unstructured":"Wilkinson, J.H.: Rounding Errors in Algebraic Processes. Dover (1963)"},{"issue":"2","key":"61_CR32","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1145\/321386.321394","volume":"14","author":"CB Moler","year":"1967","unstructured":"Moler, C.B.: Iterative refinement in floating point. J. ACM 14(2), 316\u2013321 (1967)","journal-title":"J. ACM"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-013-0061-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-013-0061-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-013-0061-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T23:04:11Z","timestamp":1716073451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-013-0061-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,27]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["61"],"URL":"https:\/\/doi.org\/10.1007\/s12532-013-0061-8","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,27]]}}}