{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T15:03:06Z","timestamp":1774710186344,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,8,29]],"date-time":"2021-08-29T00:00:00Z","timestamp":1630195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,8,29]],"date-time":"2021-08-29T00:00:00Z","timestamp":1630195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper describes the conic operator splitting method (COSMO) solver, an operator splitting algorithm and associated software package for convex optimisation problems with quadratic objective function and conic constraints. At each step, the algorithm alternates between solving a quasi-definite linear system with a constant coefficient matrix and a projection onto convex sets. The low per-iteration computational cost makes the method particularly efficient for large problems, e.g. semidefinite programs that arise in portfolio optimisation, graph theory, and robust control. Moreover, the solver uses chordal decomposition techniques and a new clique merging algorithm to effectively exploit sparsity in large, structured semidefinite programs. Numerical comparisons with other state-of-the-art solvers for a variety of benchmark problems show the effectiveness of our approach. Our Julia implementation is open source, designed to be extended and customised by the user, and is integrated into the Julia optimisation ecosystem.<\/jats:p>","DOI":"10.1007\/s10957-021-01896-x","type":"journal-article","created":{"date-parts":[[2021,8,29]],"date-time":"2021-08-29T11:02:37Z","timestamp":1630234957000},"page":"779-810","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["COSMO: A Conic Operator Splitting Method for Convex Conic Problems"],"prefix":"10.1007","volume":"190","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5773-8351","authenticated-orcid":false,"given":"Michael","family":"Garstka","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2189-7876","authenticated-orcid":false,"given":"Mark","family":"Cannon","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0456-4124","authenticated-orcid":false,"given":"Paul","family":"Goulart","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,29]]},"reference":[{"key":"1896_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0024-3795(88)90240-6","volume":"107","author":"J Agler","year":"1988","unstructured":"Agler, J., Helton, W., McCullough, S., Rodman, L.: Positive semidefinite matrices with a given sparsity pattern. Linear Algebra Appl. 107, 101\u2013149 (1988)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"1896_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F Alizadeh","year":"1995","unstructured":"Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5(1), 13\u201351 (1995)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1896_CR3","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1137\/S1052623496304700","volume":"8","author":"F Alizadeh","year":"1998","unstructured":"Alizadeh, F., Haeberly, J., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM J. Optim. 8(3), 746\u2013768 (1998)","journal-title":"SIAM J. Optim."},{"key":"1896_CR4","unstructured":"Andersen, M.S., Vandenberghe, L.: CHOMPACK: a python package for chordal matrix computations (2015)"},{"issue":"3\u20134","key":"1896_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s12532-010-0016-2","volume":"2","author":"MS Andersen","year":"2010","unstructured":"Andersen, M.S., Dahl, J., Vandenberghe, L.: Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones. Math. Program. Comput. 2(3\u20134), 167\u2013201 (2010)","journal-title":"Math. Program. Comput."},{"key":"1896_CR6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK Users\u2019 Guide","author":"E Anderson","year":"1999","unstructured":"Anderson, E., Bai, Z., Bischof, C., Blackford, L.S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A.: LAPACK Users\u2019 Guide. SIAM, Philadelphia (1999)"},{"issue":"2","key":"1896_CR7","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/s10957-019-01575-y","volume":"183","author":"G Banjac","year":"2019","unstructured":"Banjac, G., Goulart, P., Stellato, B., Boyd, S.: Infeasibility detection in the alternating direction method of multipliers for convex optimization. J. Optim. Theory Appl. 183(2), 490\u2013519 (2019)","journal-title":"J. Optim. Theory Appl."},{"issue":"12","key":"1896_CR8","doi-asserted-by":"publisher","first-page":"7870","DOI":"10.1109\/TIT.2013.2281372","volume":"59","author":"S Barman","year":"2013","unstructured":"Barman, S., Liu, X., Draper, S.C., Recht, B.: Decomposition methods for large scale LP decoding. IEEE Trans. Inf. Theory 59(12), 7870\u20137886 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1896_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017)","journal-title":"SIAM Rev."},{"issue":"1\u20134","key":"1896_CR10","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1080\/10556789908805769","volume":"11","author":"B Borchers","year":"1999","unstructured":"Borchers, B.: SDPLIB 1.2, a library of semidefinite programming test problems. Optim. Methods Softw. 11(1\u20134), 683\u2013690 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1896_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02579075","volume":"9","author":"P Borm","year":"2001","unstructured":"Borm, P., Hamers, H., Hendrickx, R.: Operations research games: a survey. Top 9(2), 139 (2001)","journal-title":"Top"},{"key":"1896_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970777","volume-title":"Linear Matrix Inequalities in System and Control Theory","author":"S Boyd","year":"1994","unstructured":"Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory, vol. 15. SIAM, Philadelphia (1994)"},{"issue":"1","key":"1896_CR13","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), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"1","key":"1896_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2400000023","volume":"3","author":"S Boyd","year":"2017","unstructured":"Boyd, S., Busseti, E., Diamond, S., Kahn, R.N., Koh, K., Nystrup, P., Speth, J.: Multi-period trading via convex optimization. Found. Trends Optim. 3(1), 1\u201376 (2017)","journal-title":"Found. Trends Optim."},{"key":"1896_CR15","unstructured":"Coleman, T.F., Li, Y.: Compact clique tree data structures in sparse matrix factorizations. In: Large-scale Numerical Optimization. SIAM (1990)"},{"issue":"3","key":"1896_CR16","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00994018","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"key":"1896_CR17","unstructured":"Davis, T.A.: Suitesparse: a suite of sparse matrix software. http:\/\/faculty.cse.tamu.edu\/davis\/suitesparse.html (2015)"},{"issue":"1","key":"1896_CR18","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. (TOMS) 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"2","key":"1896_CR19","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"key":"1896_CR20","unstructured":"Eckstein, J.: Splitting methods for monotone operators with applications to parallel optimization. Ph.D. thesis, Massachusetts Institute of Technology (1989)"},{"issue":"3","key":"1896_CR21","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.11.3.399","volume":"11","author":"H Everett","year":"1963","unstructured":"Everett, H.: Generalized Lagrange multiplier method for solving problems of optimum allocation of resources. Oper. Res. 11(3), 399\u2013417 (1963)","journal-title":"Oper. Res."},{"key":"1896_CR22","unstructured":"Fujisawa, K., Kim, S., Kojima, M., Okamoto, Y., Yamashita, M.: User\u2019s manual for SparseCoLO: Conversion methods for sparse conic-form linear optimization problems. Research Report B-453, Dept. of Math. and Comp. Sci. Japan, Tech. Rep., pp.\u00a0152\u20138552 (2009)"},{"issue":"1","key":"1896_CR23","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1080\/10556780512331319523","volume":"21","author":"K Fujisawa","year":"2006","unstructured":"Fujisawa, K., Fukuda, M., Nakata, K.: Preprocessing sparse semidefinite programs via matrix completion. Optim. Methods Softw. 21(1), 17\u201339 (2006)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"1896_CR24","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S1052623400366218","volume":"11","author":"M Fukuda","year":"2001","unstructured":"Fukuda, M., Kojima, M., Murota, K., Nakata, K.: Exploiting sparsity in semidefinite programming via matrix completion I: general framework. SIAM J. Optim. 11(3), 647\u2013674 (2001)","journal-title":"SIAM J. Optim."},{"key":"1896_CR25","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of non linear variational problems via finite element approximation. Institut de recherche d\u2019informatique et d\u2019automatique (1975)"},{"key":"1896_CR26","doi-asserted-by":"crossref","unstructured":"Garstka, M., Cannon, M., Goulart, P.: COSMO: a conic operator splitting method for large convex problems. In: 18th European Control Conference (ECC) (Naples, Italy), pp.\u00a01951\u20131956 (2019)","DOI":"10.23919\/ECC.2019.8796161"},{"issue":"2","key":"1896_CR27","doi-asserted-by":"publisher","first-page":"7355","DOI":"10.1016\/j.ifacol.2020.12.1255","volume":"53","author":"M Garstka","year":"2020","unstructured":"Garstka, M., Cannon, M., Goulart, P.: A clique graph based merging strategy for decomposable SDPs. IFAC-PapersOnLine 53(2), 7355\u20137361 (2020). 21th IFAC World Congress","journal-title":"IFAC-PapersOnLine"},{"key":"1896_CR28","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R Grone","year":"1984","unstructured":"Grone, R., Johnson, C.R., S\u00e1, E.M., Wolkowicz, H.: Positive definite completions of partial Hermitian matrices. Linear Algebra Appl. 58, 109\u2013124 (1984)","journal-title":"Linear Algebra Appl."},{"issue":"5","key":"1896_CR29","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1016\/j.ejc.2011.09.031","volume":"33","author":"M Habib","year":"2012","unstructured":"Habib, M., Stacho, J.: Reduced clique graphs of chordal graphs. Eur. J. Comb. 33(5), 712\u2013735 (2012)","journal-title":"Eur. J. Comb."},{"issue":"2","key":"1896_CR30","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6(2), 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"1896_CR31","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4(5), 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1896_CR32","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1093\/imanum\/22.3.329","volume":"22","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Computing the nearest correlation matrix-a problem from finance. IMA J. Numer. Anal. 22(3), 329\u2013343 (2002)","journal-title":"IMA J. Numer. Anal."},{"key":"1896_CR33","unstructured":"Johnson, D., Pataki, G., Alizadeh, F.: Seventh dimacs implementation challenge: semidefinite and related problems (2000). https:\/\/dimacs.rutgers.edu\/Challenges\/Seventh"},{"issue":"08","key":"1896_CR34","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.4236\/am.2015.68121","volume":"6","author":"A Kalinkin","year":"2015","unstructured":"Kalinkin, A., Anders, A., Anders, R.: Intel Math Kernel Library PARDISO* for Intel Xeon Phi manycore coprocessor. Appl. Math. 6(08), 1276 (2015)","journal-title":"Appl. Math."},{"key":"1896_CR35","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pp.\u00a0302\u2013311. ACM (1984)","DOI":"10.1145\/800057.808695"},{"issue":"1","key":"1896_CR36","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"1896_CR37","unstructured":"Legat, B., Dowson, O., Garcia, J.D., Lubin, M.: MathOptInterface: a data structure for mathematical optimization problems (2020). arXiv: 2002.03447 [math.OC]"},{"issue":"1\u20134","key":"1896_CR38","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1080\/10556789908805768","volume":"11","author":"I Maros","year":"1999","unstructured":"Maros, I., M\u00e9sz\u00e1ros, C.: A repository of convex quadratic programming problems. Optim. Methods Softw. 11(1\u20134), 671\u2013681 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"1896_CR39","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1896_CR40","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00928472","volume":"8","author":"A Miele","year":"1971","unstructured":"Miele, A., Cragg, E.E., Iyer, R.R., Levy, A.V.: Use of the augmented penalty function in mathematical programming problems, part 1. J. Optim. Theory Appl. 8(2), 115\u2013130 (1971)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1896_CR41","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF00928473","volume":"8","author":"A Miele","year":"1971","unstructured":"Miele, A., Cragg, E.E., Levy, A.V.: Use of the augmented penalty function in mathematical programming problems, part 2. J. Optim. Theory Appl. 8(2), 131\u2013153 (1971)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1896_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00934960","volume":"10","author":"A Miele","year":"1972","unstructured":"Miele, A., Moseley, P.E., Levy, A.V., Coggins, G.M.: On the method of multipliers for mathematical programming problems. J. Optim. Theory Appl. 10(1), 1\u201333 (1972)","journal-title":"J. Optim. Theory Appl."},{"key":"1896_CR43","unstructured":"Mittelmann, H.: Benchmarks for optimization software (2020). http:\/\/plato.asu.edu\/bench.html. Accessed 22 June 2020"},{"issue":"4","key":"1896_CR44","doi-asserted-by":"publisher","first-page":"3987","DOI":"10.1109\/TPWRS.2013.2258044","volume":"28","author":"DK Molzahn","year":"2013","unstructured":"Molzahn, D.K., Holzer, J.T., Lesieutre, B.C., DeMarco, C.L.: Implementation of a large-scale optimal power flow solver based on semidefinite programming. IEEE Trans. Power Syst. 28(4), 3987\u20133998 (2013)","journal-title":"IEEE Trans. Power Syst."},{"key":"1896_CR45","unstructured":"MOSEK, Aps. The MOSEK optimization toolbox for MATLAB manual. Version 8.0 (2017)"},{"issue":"2","key":"1896_CR46","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10107-002-0351-9","volume":"95","author":"K Nakata","year":"2003","unstructured":"Nakata, K., Fujisawa, K., Fukuda, M., Kojima, M., Murota, K.: Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results. Math. Program. 95(2), 303\u2013327 (2003)","journal-title":"Math. Program."},{"key":"1896_CR47","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1007\/s10957-016-0892-3","volume":"169","author":"B O\u2019Donoghue","year":"2016","unstructured":"O\u2019Donoghue, B., Chu, E., Parikh, N., Boyd, S.: Conic optimization via operator splitting and homogeneous self-dual embedding. J. Optim. Theory Appl. 169, 1042\u20131068 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1896_CR48","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"key":"1896_CR49","unstructured":"Powell, M.J.D.: A method for nonlinear constraints in minimization problems. In: Fletcher, R. (ed.) Optimization, pp. 283\u2013298. Academic Press, London, New York (1969)"},{"issue":"7","key":"1896_CR50","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1016\/j.cell.2014.11.021","volume":"159","author":"S Rao","year":"2014","unstructured":"Rao, S., Huntley, M.H., Durand, N.C., Stamenova, E.K., Bochkov, I.D., Robinson, J.T., Sanborn, A.L., Machol, I., Omer, A.D., Lander, E.S.: A 3d map of the human genome at kilobase resolution reveals principles of chromatin looping. Cell 159(7), 1665\u20131680 (2014)","journal-title":"Cell"},{"key":"1896_CR51","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"5","key":"1896_CR52","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"1896_CR53","unstructured":"Rontsis, N., Goulart, P.J., Nakatsukasa, Y.: Efficient semidefinite programming with approximate ADMM (2019). arXiv:1912.02767 [math.OC]"},{"key":"1896_CR54","unstructured":"Rontsis, N., Goulart, P.: Optimal approximation of doubly stochastic matrices. In: International Conference on Artificial Intelligence and Statistics, pp.\u00a03589\u20133598. PMLR (2020)"},{"key":"1896_CR55","unstructured":"Schenk, O., G\u00e4rtner, K., Karypis, G., R\u00f6llin, S., Hagemann, M.: Pardiso solver project. http:\/\/www.pardiso-project.org (2010)"},{"key":"1896_CR56","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s12532-020-00179-2","volume":"12","author":"B Stellato","year":"2020","unstructured":"Stellato, B., Banjac, G., Goulart, P., Bemporad, A., Boyd, S.: OSQP: an operator splitting solver for quadratic programs. Math. Program. Comput. 12, 637\u2013672 (2020)","journal-title":"Math. Program. Comput."},{"issue":"1\u20134","key":"1896_CR57","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: 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":"2","key":"1896_CR58","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/130926924","volume":"24","author":"Y Sun","year":"2014","unstructured":"Sun, Y., Andersen, M.S., Vandenberghe, L.: Decomposition in conic optimization with partially separable structure. SIAM J. Optim. 24(2), 873\u2013897 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1\u20134","key":"1896_CR59","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"K Toh","year":"1999","unstructured":"Toh, K., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3\u2013a MATLAB software package for semidefinite programming, version 1.3. Optim. Methods Softw. 11(1\u20134), 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"key":"1896_CR60","doi-asserted-by":"crossref","unstructured":"Udell, M., Mohan, K., Zeng, D., Hong, J., Diamond, S., Boyd, S.: Convex optimization in Julia. In: SC14 Workshop on High Performance Technical Computing in Dynamic Languages (2014)","DOI":"10.1109\/HPTCDL.2014.5"},{"issue":"4","key":"1896_CR61","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1561\/2400000006","volume":"1","author":"L Vandenberghe","year":"2015","unstructured":"Vandenberghe, L., Andersen, M.S.: Chordal graphs and semidefinite optimization. Found. Trends Optim. 1(4), 241\u2013433 (2015)","journal-title":"Found. Trends Optim."},{"key":"1896_CR62","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods, vol. 54. SIAM, Philadelphia (1997)"},{"key":"1896_CR63","volume-title":"Numerical Optimization","author":"S Wright","year":"1999","unstructured":"Wright, S., Nocedal, J.: Numerical Optimization, vol. 35. Springer, Berlin (1999)"},{"issue":"1","key":"1896_CR64","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebraic Discrete Methods 2(1), 77\u201379 (1981)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"1896_CR65","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Doubly stochastic normalization for spectral clustering. In: Advances in Neural Information Processing Systems, pp.\u00a01569\u20131576 (2007)","DOI":"10.7551\/mitpress\/7503.003.0201"},{"issue":"1","key":"1896_CR66","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10107-019-01366-3","volume":"180","author":"Y Zheng","year":"2020","unstructured":"Zheng, Y., Fantuzzi, G., Papachristodoulou, A., Goulart, P., Wynn, A.: Chordal decomposition in operator-splitting methods for sparse semidefinite programs. Math. Program. 180(1), 489\u2013532 (2020)","journal-title":"Math. Program."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01896-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-021-01896-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01896-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T23:47:19Z","timestamp":1699400839000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-021-01896-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,29]]},"references-count":66,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["1896"],"URL":"https:\/\/doi.org\/10.1007\/s10957-021-01896-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,29]]},"assertion":[{"value":"8 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}