{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:15:40Z","timestamp":1780344940001,"version":"3.54.1"},"reference-count":102,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,22]],"date-time":"2016-02-22T00:00:00Z","timestamp":1456099200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,2,22]],"date-time":"2016-02-22T00:00:00Z","timestamp":1456099200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-12-2-0306"],"award-info":[{"award-number":["FA8750-12-2-0306"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-0645962"],"award-info":[{"award-number":["DGE-0645962"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10957-016-0892-3","type":"journal-article","created":{"date-parts":[[2016,2,22]],"date-time":"2016-02-22T19:21:36Z","timestamp":1456168896000},"page":"1042-1068","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":449,"title":["Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding"],"prefix":"10.1007","volume":"169","author":[{"given":"Brendan","family":"O\u2019Donoghue","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neal","family":"Parikh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Boyd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,2,22]]},"reference":[{"key":"892_CR1","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"Y Ye","year":"2011","unstructured":"Ye, Y.: Interior Point Algorithms: Theory and Analysis. Wiley, London (2011)"},{"issue":"1","key":"892_CR2","doi-asserted-by":"publisher","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), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"892_CR3","unstructured":"Skajaa, A., Ye, Y.: A homogeneous interior-point algorithm for nonsymmetric convex conic optimization. http:\/\/www.stanford.edu\/yyye\/nonsymmhsdimp.pdf (2012)"},{"key":"892_CR4","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marrocco, A.: Sur l\u2019approximation, par elements finis d\u2019ordre un, et la resolution, par penalisation-dualit\u00e9, d\u2019une classe de problems de Dirichlet non lineares. Rev. Fr. d\u2019Autom. Inf. Rech. Op\u00e9r. 9, 41\u201376 (1975)","journal-title":"Rev. Fr. d\u2019Autom. Inf. Rech. Op\u00e9r."},{"key":"892_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximations. Comput. Math. Appl. 2, 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"892_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0168-2024(08)70034-1","volume-title":"Augmented Lagrangian Methods: Applications to Numerical Solution of Boundary-Value Problems","author":"D Gabay","year":"1983","unstructured":"Gabay, D.: Applications of the method of multipliers to variational inequalities. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Applications to Numerical Solution of Boundary-Value Problems, pp. 299\u2013331. North-Holland, Amsterdam (1983)"},{"key":"892_CR7","unstructured":"Eckstein, J.: Splitting methods for monotone operators with applications to parallel optimization. Ph.D. thesis, Massachusetts Institute of Technology (1989)"},{"key":"892_CR8","doi-asserted-by":"publisher","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\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"2","key":"892_CR9","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: On the $${O(1\/n)}$$ convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J. Numer. Anal. 50(2), 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"892_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y Ye","year":"1994","unstructured":"Ye, Y., Todd, M., Mizuno, S.: An $$O(\\sqrt{n}L)$$-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19(1), 53\u201367 (1994)","journal-title":"Math. Oper. Res."},{"key":"892_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02206815","volume":"62","author":"X Xu","year":"1996","unstructured":"Xu, X., Hung, P., Ye, Y.: A simplified homogeneous and self-dual linear programming algorithm and its implementation. Ann. Oper. Res. 62, 151\u2013171 (1996)","journal-title":"Ann. Oper. Res."},{"key":"892_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Methods in Convex Programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovski, A.: Interior-Point Polynomial Methods in Convex Programming. SIAM, Philadelphia (1994)"},{"issue":"3\u20134","key":"892_CR13","doi-asserted-by":"publisher","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\u20134), 203\u2013230 (2010)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"892_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-008-0261-6","volume":"126","author":"G Lan","year":"2011","unstructured":"Lan, G., Lu, Z., Monteiro, R.: Primal\u2013dual first-order methods with $${\\cal O}(1\/\\epsilon )$$ iteration-complexity for cone programming. Math. Program. 126(1), 1\u201329 (2011)","journal-title":"Math. Program."},{"key":"892_CR15","unstructured":"Aybat, N., Iyengar, G.: An augmented Lagrangian method for conic convex programming. Preprint (2013). arXiv:1302.6322v1"},{"key":"892_CR16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-1-4613-9940-7_3","volume-title":"Advances in Order Restricted Statistical Inference. Lecture Notes in Statistics","author":"J Boyle","year":"1986","unstructured":"Boyle, J., Dykstra, R.: A method for finding projections onto the intersection of convex sets in Hilbert spaces. In: Dykstra, R., Robertson, T., Wright, F. (eds.) Advances in Order Restricted Statistical Inference. Lecture Notes in Statistics, vol. 37, pp. 28\u201347. Springer, New York (1986)"},{"issue":"3","key":"892_CR17","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1006\/jath.1994.1136","volume":"79","author":"H Bauschke","year":"1994","unstructured":"Bauschke, H., Borwein, J.: Dykstra\u2019s alternating projection algorithm for two sets. J. Approx. Theory 79(3), 418\u2013443 (1994)","journal-title":"J. Approx. Theory"},{"issue":"3","key":"892_CR18","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/s10589-011-9401-7","volume":"51","author":"Y Censor","year":"2012","unstructured":"Censor, Y., Chen, W., Combettes, P., Davidi, R., Herman, G.: On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints. Comput. Optim. Appl. 51(3), 1065\u20131088 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"892_CR19","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02142692","volume":"8","author":"Y Censor","year":"1994","unstructured":"Censor, Y., Elfving, T.: A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 8, 221\u2013239 (1994)","journal-title":"Numer. Algorithms"},{"key":"892_CR20","unstructured":"Bauschke, H., Koch, V.: Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces. arXiv:1301.4506 (2013)"},{"key":"892_CR21","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992)","journal-title":"Math. Program."},{"issue":"2","key":"892_CR22","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s11228-011-0191-y","volume":"20","author":"P Combettes","year":"2012","unstructured":"Combettes, P., Pesquet, J.: Primal\u2013dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators. Set-Valued Var. Anal. 20(2), 307\u2013330 (2012)","journal-title":"Set-Valued Var. Anal."},{"issue":"4","key":"892_CR23","doi-asserted-by":"publisher","first-page":"2420","DOI":"10.1137\/130904160","volume":"23","author":"P Combettes","year":"2013","unstructured":"Combettes, P.: Systems of structured monotone inclusions: duality, algorithms, and applications. SIAM J. Optim. 23(4), 2420\u20132447 (2013)","journal-title":"SIAM J. Optim."},{"key":"892_CR24","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Pesquet, J.: Playing with duality: an overview of recent primal\u2013dual approaches for solving large-scale optimization problems. arXiv:1406.5429 (2014)","DOI":"10.1109\/MSP.2014.2377273"},{"key":"892_CR25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970838","volume-title":"Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics","author":"R Glowinski","year":"1989","unstructured":"Glowinski, R., Le Tallec, P.: Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics. SIAM, Philadelphia (1989)"},{"issue":"6","key":"892_CR26","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"P Lions","year":"1979","unstructured":"Lions, P., 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":"892_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12613-4","volume-title":"Numerical Methods for Nonlinear Variational Problems","author":"R Glowinski","year":"1984","unstructured":"Glowinski, R.: Numerical Methods for Nonlinear Variational Problems. Springer, Berlin (1984)"},{"key":"892_CR28","volume-title":"Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems","author":"M Fortin","year":"1983","unstructured":"Fortin, M., Glowinski, R.: Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems. North-Holland, Amsterdam (1983)"},{"key":"892_CR29","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"Douglas, J., Rachford, H.: On the numerical solution of the heat conduction problem in 2 and 3 space variables. Trans. Am. Math. Soc. 82, 421\u2013439 (1956)","journal-title":"Trans. Am. Math. Soc."},{"issue":"5","key":"892_CR30","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R Rockafellar","year":"1976","unstructured":"Rockafellar, R.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"892_CR31","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01448388","volume":"10","author":"J Spingarn","year":"1983","unstructured":"Spingarn, J.: Partial inverse of a monotone operator. Appl. Math. Optim. 10, 247\u2013265 (1983)","journal-title":"Appl. Math. Optim."},{"key":"892_CR32","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01586091","volume":"32","author":"J Spingarn","year":"1985","unstructured":"Spingarn, J.: Applications of the method of partial inverses to convex programming: decomposition. Math. Program. 32, 199\u2013223 (1985)","journal-title":"Math. Program."},{"key":"892_CR33","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0024-3795(85)90086-2","volume":"65","author":"J Spingarn","year":"1985","unstructured":"Spingarn, J.: A primal\u2013dual projection method for solving systems of linear inequalities. Linear Algebra Appl. 65, 45\u201362 (1985)","journal-title":"Linear Algebra Appl."},{"key":"892_CR34","unstructured":"Eckstein, J.: The Lions\u2013Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm. Tech. Rep. LIDS-P-1769, Massachusetts Institute of Technology (1989)"},{"issue":"2","key":"892_CR35","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1088\/0266-5611\/18\/2\/310","volume":"18","author":"C Byrne","year":"2002","unstructured":"Byrne, C.: Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probab. 18(2), 441 (2002)","journal-title":"Inverse Probab."},{"issue":"2","key":"892_CR36","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1016\/j.jmaa.2006.05.010","volume":"327","author":"Y Censor","year":"2007","unstructured":"Censor, Y., Motova, A., Segal, A.: Perturbed projections and subgradient projections for the multiple-sets split feasibility problem. J. Math. Anal. Appl. 327(2), 1244\u20131256 (2007)","journal-title":"J. Math. Anal. Appl."},{"key":"892_CR37","doi-asserted-by":"crossref","unstructured":"Censor, T.: Sequential and parallel projection algorithms for feasibility and optimization. In: Multispectral Image Processing and Pattern Recognition, pp. 1\u20139. Bellingham: International Society for Optics and Photonics (2001)","DOI":"10.1117\/12.441550"},{"key":"892_CR38","doi-asserted-by":"crossref","unstructured":"Yan, M., Yin, W.: Self equivalence of the alternating direction method of multipliers. arXiv:1407.7400 (2014)","DOI":"10.21236\/ADA610274"},{"key":"892_CR39","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S1076-5670(08)70157-5","volume":"95","author":"P Combettes","year":"1996","unstructured":"Combettes, P.: The convex feasibility problem in image recovery. Adv. Imaging Electron Phys. 95, 155\u2013270 (1996)","journal-title":"Adv. Imaging Electron Phys."},{"issue":"2","key":"892_CR40","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/080725891","volume":"2","author":"T Goldstein","year":"2009","unstructured":"Goldstein, T., Osher, S.: The split Bregman method for L1-regularized problems. SIAM J. Imaging Sci. 2(2), 323\u2013343 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"892_CR41","doi-asserted-by":"publisher","first-page":"1724","DOI":"10.1137\/13094671X","volume":"7","author":"D O\u2019Connor","year":"2014","unstructured":"O\u2019Connor, D., Vandenberghe, L.: Image deblurring by primal\u2013dual operator splitting. SIAM J. Imaging Sci. 7(3), 1724\u20131754 (2014)","journal-title":"SIAM J. Imaging Sci."},{"key":"892_CR42","doi-asserted-by":"crossref","unstructured":"Lin, F., Fardad, M., Jovanovic, M.: Design of optimal sparse feedback gains via the alternating direction method of multipliers. In: Proceedings of the 2012 American Control Conference, pp. 4765\u20134770 (2012)","DOI":"10.1109\/ACC.2012.6315694"},{"key":"892_CR43","doi-asserted-by":"crossref","unstructured":"Annergren, M., Hansson, A., Wahlberg, B.: An ADMM algorithm for solving $$\\ell _1$$ regularized MPC (2012)","DOI":"10.1109\/CDC.2012.6426429"},{"key":"892_CR44","unstructured":"O\u2019Donoghue, B., Stathopoulos, G., Boyd, S.: A splitting method for optimal control. IEEE Trans. Control Syst. Technol. 21(6), 2432\u20132442 (2013)"},{"key":"892_CR45","doi-asserted-by":"crossref","unstructured":"Mota, J., Xavier, J., Aguiar, P., Puschel, M.: Distributed ADMM for model predictive control and congestion control. In: 2012 IEEE 51st Annual Conference on Decision and Control (CDC), pp. 5110\u20135115 (2012)","DOI":"10.1109\/CDC.2012.6426141"},{"key":"892_CR46","unstructured":"O\u2019Donoghue, B.: Suboptimal control policies via convex optimization. Ph.D. thesis, Stanford University (2012)"},{"key":"892_CR47","doi-asserted-by":"crossref","unstructured":"Wahlberg, B., Boyd, S., Annergren, M., Wang, Y.: An ADMM algorithm for a class of total variation regularized estimation problems. In: Proceedings 16th IFAC Symposium on System Identification (to appear) (2012)","DOI":"10.3182\/20120711-3-BE-2027.00310"},{"issue":"4","key":"892_CR48","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"P Combettes","year":"2006","unstructured":"Combettes, P., Wajs, V.: Signal recovery by proximal forward\u2013backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2006)","journal-title":"Multiscale Model. Simul."},{"issue":"4","key":"892_CR49","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/JSTSP.2007.910264","volume":"1","author":"P Combettes","year":"2007","unstructured":"Combettes, P., Pesquet, J.: A Douglas\u2013Rachford splitting approach to nonsmooth convex variational signal recovery. IEEE J. Sel. Top. Sign. Proces. 1(4), 564\u2013574 (2007)","journal-title":"IEEE J. Sel. Top. Sign. Proces."},{"key":"892_CR50","doi-asserted-by":"crossref","unstructured":"Combettes, P., Pesquet, J.: Proximal splitting methods in signal processing. In: Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185\u2013212. Springer, Berlin (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"issue":"1","key":"892_CR51","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang, J., Zhang, Y.: Alternating direction algorithms for $$\\ell _1$$-problems in compressive sensing. SIAM J. Sci. Comput. 33(1), 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"892_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2400000001","volume":"1","author":"S Boyd","year":"2013","unstructured":"Boyd, S., Mueller, M., O\u2019Donoghue, B., Wang, Y.: Performance bounds and suboptimal policies for multi-period investment. Found. Trends Optim. 1(1), 1\u201369 (2013)","journal-title":"Found. Trends Optim."},{"key":"892_CR53","unstructured":"Parikh, N., Boyd, S.: Block splitting for distributed optimization. Math. Program. Comput. 6(1), 77\u2013102 (2013)"},{"issue":"2","key":"892_CR54","first-page":"70","volume":"1","author":"M Kraning","year":"2014","unstructured":"Kraning, M., Chu, E., Lavaei, J., Boyd, S.: Dynamic network energy management via proximal message passing. Found. Trends Optim. 1(2), 70\u2013122 (2014)","journal-title":"Found. Trends Optim."},{"issue":"1","key":"892_CR55","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\u2013dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"892_CR56","unstructured":"Becker, S., Cand\u00e8s, E., Grant, M.: Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput. 3(3), 1\u201354 (2010)"},{"issue":"2","key":"892_CR57","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10589-010-9361-3","volume":"51","author":"J Gondzio","year":"2012","unstructured":"Gondzio, J.: Matrix-free interior point method. Comput. Optim. Appl. 51(2), 457\u2013480 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"892_CR58","unstructured":"Monteiro, R., Ortiz, C., Svaiter, B.: An inexact block-decomposition method for extra large-scale conic semidefinite programming. Optimization-online preprint 4158, 1\u201321 (2013)"},{"key":"892_CR59","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10589-013-9590-3","volume":"57","author":"R Monteiro","year":"2014","unstructured":"Monteiro, R., Ortiz, C., Svaiter, B.: Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems. Comput. Optim. Appl. 57, 45\u201369 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"892_CR60","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-013-0062-7","volume":"6","author":"R Monteiro","year":"2014","unstructured":"Monteiro, R., Ortiz, C., Svaiter, B.: A first-order block-decomposition method for solving two-easy-block structured semidefinite programs. Math. Program. Comput. 6, 103\u2013150 (2014)","journal-title":"Math. Program. Comput."},{"key":"892_CR61","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X Zhao","year":"2010","unstructured":"Zhao, X., Sun, D., Toh, K.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20, 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."},{"key":"892_CR62","unstructured":"O\u2019Donoghue, B., Cand\u00e8s, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15(3), 715\u2013732 (2015)"},{"issue":"4","key":"892_CR63","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.: A general framework for a class of first order primal\u2013dual algorithms for convex optimization in imaging science. SIAM J. Imaging Sci. 3(4), 1015\u20131046 (2010)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"892_CR64","first-page":"123","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2014)","journal-title":"Found. Trends Optim."},{"key":"892_CR65","doi-asserted-by":"publisher","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)"},{"key":"892_CR66","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R Rockafellar","year":"1970","unstructured":"Rockafellar, R.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"892_CR67","volume-title":"Feedback Control of Dynamic Systems","author":"G Franklin","year":"1994","unstructured":"Franklin, G., Powell, J., Emami-Naeini, A.: Feedback Control of Dynamic Systems, vol. 3. Addison-Wesley, Reading, MA (1994)"},{"key":"892_CR68","unstructured":"Gol\u2019shtein, E., Tret\u2019yakov, N.: Modified Lagrangians in convex programming and their generalizations. Point-to-Set Maps Math. Program. 10, 86\u201397 (1979)"},{"issue":"1","key":"892_CR69","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02196592","volume":"80","author":"J Eckstein","year":"1994","unstructured":"Eckstein, J.: Parallel alternating direction multiplier decomposition of convex programs. J. Optim. Theory Appl. 80(1), 39\u201362 (1994)","journal-title":"J. Optim. Theory Appl."},{"key":"892_CR70","unstructured":"Pataki, G., Schmieta, S.: The DIMACS library of mixed semidefinite-quadratic-linear programs. dimacs.rutgers.edu\/Challenges\/Seventh\/Instances"},{"key":"892_CR71","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10107-002-0355-5","volume":"95","author":"H Mittelmann","year":"2003","unstructured":"Mittelmann, H.: An independent benchmarking of SDP and SOCP solvers. Math. Program. (Ser. B) 95, 407\u2013430 (2003)","journal-title":"Math. Program. (Ser. B)"},{"key":"892_CR72","volume-title":"Matrix Computations","author":"G Golub","year":"1996","unstructured":"Golub, G., Van Loan, C.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"892_CR73","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881","volume-title":"Direct Methods for Sparse Linear Systems. SIAM Fundamentals of Algorithms","author":"T Davis","year":"2006","unstructured":"Davis, T.: Direct Methods for Sparse Linear Systems. SIAM Fundamentals of Algorithms. SIAM, Philadelphia (2006)"},{"issue":"1","key":"892_CR74","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/0805005","volume":"5","author":"R Vanderbei","year":"1995","unstructured":"Vanderbei, R.: Symmetric quasi-definite matrices. SIAM J. Optim. 5(1), 100\u2013113 (1995)","journal-title":"SIAM J. Optim."},{"key":"892_CR75","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, Berlin (2006)"},{"key":"892_CR76","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia (2003)"},{"issue":"1","key":"892_CR77","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01385880","volume":"5","author":"F Bauer","year":"1963","unstructured":"Bauer, F.: Optimally scaled matrices. Numer. Math. 5(1), 73\u201387 (1963)","journal-title":"Numer. Math."},{"issue":"1","key":"892_CR78","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02165268","volume":"13","author":"F Bauer","year":"1969","unstructured":"Bauer, F.: Remarks on optimally scaled matrices. Numer. Math. 13(1), 1\u20133 (1969)","journal-title":"Numer. Math."},{"issue":"1","key":"892_CR79","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF02165096","volume":"14","author":"A Van Der Sluis","year":"1969","unstructured":"Van Der Sluis, A.: Condition numbers and equilibration of matrices. Numer. Math. 14(1), 14\u201323 (1969)","journal-title":"Numer. Math."},{"key":"892_CR80","unstructured":"Ruiz, D.: A scaling algorithm to equilibrate both rows and columns norms in matrices. Tech. Rep., Rutherford Appleton Laboratories (2001)"},{"issue":"4","key":"892_CR81","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1145\/321043.321048","volume":"7","author":"E Osborne","year":"1960","unstructured":"Osborne, E.: On pre-conditioning of matrices. JACM 7(4), 338\u2013345 (1960)","journal-title":"JACM"},{"key":"892_CR82","doi-asserted-by":"crossref","unstructured":"Pock, T., Chambolle, A.: Diagonal preconditioning for first order primal\u2013dual algorithms in convex optimization. In: Proceedings of the 2011 IEEE International Conference on Computer Vision (ICCV), pp. 1762\u20131769. IEEE (2011)","DOI":"10.1109\/ICCV.2011.6126441"},{"key":"892_CR83","doi-asserted-by":"crossref","unstructured":"Giselsson, P., Boyd, S.: Diagonal scaling in Douglas\u2013Rachford splitting and ADMM. In: Proceedings of the 54th IEEE Conference on Decision and Control, pp. 5033\u20135039 (2014)","DOI":"10.1109\/CDC.2014.7040175"},{"key":"892_CR84","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.automatica.2015.09.010","volume":"62","author":"P Giselsson","year":"2015","unstructured":"Giselsson, P., Boyd, S.: Metric selection in fast dual forward backward splitting. Automatica 62, 1\u201310 (2015)","journal-title":"Automatica"},{"issue":"12","key":"892_CR85","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"K Toh","year":"1999","unstructured":"Toh, K., Todd, M., T\u00fct\u00fcnc\u00fc, R.: SDPT3: A Matlab software package for semidefinite programming. Optim. Methods Softw. 11(12), 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"key":"892_CR86","doi-asserted-by":"crossref","unstructured":"SCS: Splitting conic solver v1.1.0. https:\/\/github.com\/cvxgrp\/scs (2015)","DOI":"10.1002\/9783527678679.dg11558"},{"key":"892_CR87","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.0 beta. http:\/\/cvxr.com\/cvx (2013)"},{"key":"892_CR88","unstructured":"Diamond, S., Boyd, S.: CVXPY: A python-embedded modeling language for convex optimization. http:\/\/web.stanford.edu\/boyd\/papers\/cvxpy_paper.html (2015)"},{"key":"892_CR89","doi-asserted-by":"crossref","unstructured":"Udell, M., Mohan, K., Zeng, D., Hong, J., Diamond, S., Boyd, S.: Convex optimization in Julia. SC14 Workshop on High Performance Technical Computing in Dynamic Languages (2014)","DOI":"10.1109\/HPTCDL.2014.5"},{"key":"892_CR90","unstructured":"Lofberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB. In: IEEE International Symposium on Computed Aided Control Systems Design, pp. 294\u2013289 (2004)"},{"issue":"4","key":"892_CR91","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1145\/1114268.1114277","volume":"31","author":"T Davis","year":"2005","unstructured":"Davis, T.: Algorithm 849: a concise sparse Cholesky factorization package. ACM Trans. Math. Softw. 31(4), 587\u2013591 (2005)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"892_CR92","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/1024074.1024081","volume":"30","author":"P Amestoy","year":"2004","unstructured":"Amestoy, P., Davis, T., Duff, I.: 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":"892_CR93","unstructured":"OpenMP Architecture Review Board: OpenMP application program interface version 3.0. http:\/\/www.openmp.org\/mp-documents\/spec30.pdf (2008)"},{"issue":"2","key":"892_CR94","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1365490.1365500","volume":"6","author":"J Nickolls","year":"2008","unstructured":"Nickolls, J., Buck, I., Garland, M., Skadron, K.: Scalable parallel programming with CUDA. Queue 6(2), 40\u201353 (2008)","journal-title":"Queue"},{"key":"892_CR95","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Towards nonsymmetric conic optimization. http:\/\/www.optimization-online.org\/DB_FILE\/2006\/03\/1355.pdf (2006). CORE discussion paper","DOI":"10.2139\/ssrn.921788"},{"key":"892_CR96","doi-asserted-by":"crossref","unstructured":"Skajaa, A., Ye, Y.: A homogeneous interior-point algorithm for nonsymmetric convex conic optimization. Math. Program. 150(2), 391\u2013422 (2015)","DOI":"10.1007\/s10107-014-0773-1"},{"key":"892_CR97","unstructured":"Khanh Hien, L.: Differential properties of Euclidean projection onto power cone. http:\/\/www.optimization-online.org\/DB_FILE\/2014\/08\/4502.pdf (2014)"},{"issue":"1","key":"892_CR98","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"},{"issue":"11","key":"892_CR99","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., De Mol, C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 57(11), 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math."},{"key":"892_CR100","unstructured":"Demanet, L., Zhang, X.: Eventual linear convergence of the Douglas\u2013Rachford iteration for basis pursuit. arXiv preprint arXiv:1301.0542 (2013)"},{"key":"892_CR101","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"M Lobo","year":"1998","unstructured":"Lobo, M., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284, 193\u2013228 (1998)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"892_CR102","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio selection. J. Finance 7(1), 77\u201391 (1952)","journal-title":"J. Finance"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-0892-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-016-0892-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-0892-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-0892-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T13:26:36Z","timestamp":1748784396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-016-0892-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,22]]},"references-count":102,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["892"],"URL":"https:\/\/doi.org\/10.1007\/s10957-016-0892-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,22]]},"assertion":[{"value":"24 February 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}