{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T16:29:59Z","timestamp":1768408199876,"version":"3.49.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T00:00:00Z","timestamp":1748649600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T00:00:00Z","timestamp":1748649600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2022YFA1005102"],"award-info":[{"award-number":["2022YFA1005102"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12201618"],"award-info":[{"award-number":["12201618"]}],"id":[{"id":"10.13039\/501100001809","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":[[2025,7]]},"DOI":"10.1007\/s10915-025-02952-8","type":"journal-article","created":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T13:57:55Z","timestamp":1748699875000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving Low-Rank Semidefinite Programs via Manifold Optimization"],"prefix":"10.1007","volume":"104","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9681-1451","authenticated-orcid":false,"given":"Jie","family":"Wang","sequence":"first","affiliation":[]},{"given":"Liangbing","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,31]]},"reference":[{"key":"2952_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"P-A Absil","year":"2007","unstructured":"Absil, P.-A., Baker, C.G., Gallivan, K.A.: Trust-region methods on Riemannian manifolds. Found. Comput. Math. 7, 303\u2013330 (2007). https:\/\/doi.org\/10.1007\/s10208-005-0179-9","journal-title":"Found. Comput. Math."},{"key":"2952_CR2","doi-asserted-by":"crossref","unstructured":"Absil, P.A., Mahony, R., Trumpf, J.: An extrinsic look at the Riemannian Hessian, in Geometric Science of Information: First International Conference, GSI: Paris, France, August 28\u201330, 2013. Proceedings, Springer 2013, 361\u2013368 (2013)","DOI":"10.1007\/978-3-642-40020-9_39"},{"key":"2952_CR3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10107-002-0349-3","volume":"95","author":"ED Andersen","year":"2003","unstructured":"Andersen, E.D., Roos, C., Terlaky, T.: On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Program. 95, 249\u2013277 (2003)","journal-title":"Math. Program."},{"key":"2952_CR4","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.ijepes.2007.12.003","volume":"30","author":"X Bai","year":"2008","unstructured":"Bai, X., Wei, H., Fujisawa, K., Wang, Y.: Semidefinite programming for optimal power flow problems. International Journal of Electrical Power & Energy Systems 30, 383\u2013392 (2008)","journal-title":"International Journal of Electrical Power & Energy Systems"},{"key":"2952_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10915-021-01654-1","volume":"89","author":"S Bellavia","year":"2021","unstructured":"Bellavia, S., Gondzio, J., Porcelli, M.: A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion. J. Sci. Comput. 89, 1\u201336 (2021)","journal-title":"J. Sci. Comput."},{"key":"2952_CR6","first-page":"1455","volume":"15","author":"N Boumal","year":"2014","unstructured":"Boumal, N., Mishra, B., Absil, P.-A., Sepulchre, R.: Manopt, a Matlab toolbox for optimization on manifolds. J. Mach. Learn. Res. 15, 1455\u20131459 (2014). (https:\/\/www.manopt.org)","journal-title":"J. Mach. Learn. Res."},{"key":"2952_CR7","unstructured":"Boumal, N., Voroninski, V., Bandeira, A.: The non-convex burer-monteiro approach works on smooth semidefinite programs, Adv. Neural Inf. Process Syst., 29 (2016)"},{"key":"2952_CR8","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1002\/cpa.21830","volume":"73","author":"N Boumal","year":"2020","unstructured":"Boumal, N., Voroninski, V., Bandeira, A.S.: Deterministic guarantees for burer-monteiro factorizations of smooth semidefinite programs. Commun. Pure Appl. Math. 73, 581\u2013608 (2020)","journal-title":"Commun. Pure Appl. Math."},{"key":"2952_CR9","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.D.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95, 329\u2013357 (2003)","journal-title":"Math. Program."},{"key":"2952_CR10","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"S Burer","year":"2005","unstructured":"Burer, S., Monteiro, R.D.: Local minima and convergence in low-rank semidefinite programming. Math. Program. 103, 427\u2013444 (2005)","journal-title":"Math. Program."},{"key":"2952_CR11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/2184319.2184343","volume":"55","author":"E Candes","year":"2012","unstructured":"Candes, E., Recht, B.: Exact matrix completion via convex optimization. Commun. ACM 55, 111\u2013119 (2012)","journal-title":"Commun. ACM"},{"key":"2952_CR12","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inf. Theory 56, 2053\u20132080 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2952_CR13","volume":"80","author":"D Cavalcanti","year":"2016","unstructured":"Cavalcanti, D., Skrzypczyk, P.: Quantum steering: A review with focus on semidefinite programming. Rep. Prog. Phys. 80, 024001 (2016)","journal-title":"Rep. Prog. Phys."},{"key":"2952_CR14","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1137\/19M1257640","volume":"42","author":"D Cifuentes","year":"2021","unstructured":"Cifuentes, D.: A convex relaxation to compute the nearest structured rank deficient matrix. SIAM J. Matrix Anal. Appl. 42, 708\u2013729 (2021)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2952_CR15","doi-asserted-by":"crossref","unstructured":"Cifuentes, D.: On the burer\u2013monteiro method for general semidefinite programs, Optim. Lett., pp.\u00a01\u201311 (2021)","DOI":"10.1007\/s11590-021-01705-4"},{"key":"2952_CR16","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s10107-021-01696-1","volume":"193","author":"D Cifuentes","year":"2022","unstructured":"Cifuentes, D., Agarwal, S., Parrilo, P.A., Thomas, R.R.: On the local stability of semidefinite relaxations. Math. Program. 193, 629\u2013663 (2022)","journal-title":"Math. Program."},{"key":"2952_CR17","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-018-1300-6","volume":"178","author":"Y Cui","year":"2019","unstructured":"Cui, Y., Sun, D., Toh, K.-C.: On the r-superlinear convergence of the kkt residuals generated by the augmented lagrangian method for convex composite conic programming. Math. Program. 178, 381\u2013415 (2019)","journal-title":"Math. Program."},{"key":"2952_CR18","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/TSP.2008.2008247","volume":"57","author":"A De Maio","year":"2008","unstructured":"De Maio, A., De Nicola, S., Huang, Y., Luo, Z.-Q., Zhang, S.: Design of phase codes for radar performance optimization with a similarity constraint. IEEE Trans. Signal Process. 57, 610\u2013621 (2008)","journal-title":"IEEE Trans. Signal Process."},{"key":"2952_CR19","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1007\/s10957-021-01896-x","volume":"190","author":"M Garstka","year":"2021","unstructured":"Garstka, M., Cannon, M., Goulart, P.: Cosmo: A conic operator splitting method for convex conic problems. J. Optim. Theory Appl. 190, 779\u2013810 (2021)","journal-title":"J. Optim. Theory Appl."},{"key":"2952_CR20","first-page":"143","volume":"79","author":"MX Goemans","year":"1997","unstructured":"Goemans, M.X.: Semidefinite programming in combinatorial optimization. Math. Program. 79, 143\u2013161 (1997)","journal-title":"Math. Program."},{"key":"2952_CR21","unstructured":"Habibi, S., Kavand, A., Kocvara, M., Stingl, M.: Barrier and penalty methods for low-rank semidefinite programming with application to truss topology design, arXiv preprint arXiv:2105.08529, (2021)"},{"key":"2952_CR22","unstructured":"Han, Q., Li, C., Lin, Z., Chen, C., Deng, Q., Ge, D., Liu, H., Ye, Y.: A low-rank admm splitting approach for semidefinite programming, arXiv preprint arXiv:2403.09133, (2024)"},{"key":"2952_CR23","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10, 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"key":"2952_CR24","unstructured":"Huang, Y., Gleich, D.F.: Suboptimality bounds for trace-bounded sdps enable a faster and scalable low-rank sdp solver sdplr+, arXiv preprint arXiv:2406.10407, (2024)"},{"key":"2952_CR25","doi-asserted-by":"crossref","first-page":"2327","DOI":"10.1137\/080731359","volume":"20","author":"M Journ\u00e9e","year":"2010","unstructured":"Journ\u00e9e, M., Bach, F., Absil, P.-A., Sepulchre, R.: Low-rank optimization on the cone of positive semidefinite matrices. SIAM J. Optim. 20, 2327\u20132351 (2010)","journal-title":"SIAM J. Optim."},{"key":"2952_CR26","first-page":"293","volume":"2001","author":"J. B. Lasserre, An explicit exact sdp relaxation for nonlinear 0\u20131 programs, in Integer Programming and Combinatorial Optimization: 8th International IPCO Conference Utrecht, The Netherlands, June 13\u201315","year":"2001","unstructured":"J. B. Lasserre, An explicit exact sdp relaxation for nonlinear 0\u20131 programs, in Integer Programming and Combinatorial Optimization: 8th International IPCO Conference Utrecht, The Netherlands, June 13\u201315: Proceedings 8. Springer 2001, 293\u2013303 (2001)","journal-title":"Springer"},{"key":"2952_CR27","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J-B Lasserre","year":"2001","unstructured":"Lasserre, J.-B.: Global Optimization with Polynomials and the Problem of Moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"2952_CR28","first-page":"41013","volume":"37","author":"F-Y Liao","year":"2025","unstructured":"Liao, F.-Y., Ding, L., Zheng, Y.: Inexact augmented lagrangian methods for conic optimization: Quadratic growth and linear convergence. Adv. Neural. Inf. Process. Syst. 37, 41013\u201341050 (2025)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2952_CR29","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1007\/s00245-019-09564-3","volume":"82","author":"C Liu","year":"2020","unstructured":"Liu, C., Boumal, N.: Simple algorithms for optimization on riemannian manifolds with constraints. Applied Mathematics & Optimization 82, 949\u2013981 (2020)","journal-title":"Applied Mathematics & Optimization"},{"key":"2952_CR30","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/MSP.2010.936019","volume":"27","author":"Z-Q Luo","year":"2010","unstructured":"Luo, Z.-Q., Ma, W.-K., So, A.M.-C., Ye, Y., Zhang, S.: Semidefinite relaxation of quadratic optimization problems. IEEE Signal Process. Mag. 27, 20\u201334 (2010)","journal-title":"IEEE Signal Process. Mag."},{"key":"2952_CR31","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1016\/j.automatica.2007.09.011","volume":"44","author":"I Markovsky","year":"2008","unstructured":"Markovsky, I.: Structured low-rank approximation and its applications. Automatica 44, 891\u2013909 (2008)","journal-title":"Automatica"},{"key":"2952_CR32","unstructured":"Monteiro, R.D., Sujanani, A., Cifuentes, D.: A low-rank augmented lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach, arXiv preprint arXiv:2401.12490, (2024)"},{"key":"2952_CR33","doi-asserted-by":"crossref","first-page":"307","DOI":"10.3166\/ejc.9.307-321","volume":"9","author":"PA Parrilo","year":"2003","unstructured":"Parrilo, P.A., Lall, S.: Semidefinite programming relaxations and algebraic optimization in control. Eur. J. Control. 9, 307\u2013321 (2003)","journal-title":"Eur. J. Control."},{"key":"2952_CR34","unstructured":"Lee, C.P., Liang, L., Tang, T., Toh, K.-C.: Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition, Journal of Machine Learning Research, 25(379), 1\u201352 (2024)"},{"key":"2952_CR35","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1, 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"2952_CR36","doi-asserted-by":"crossref","unstructured":"Rosen, D.M.: Scalable low-rank semidefinite programming for certifiably correct machine perception, in Algorithmic Foundations of Robotics XIV: Proceedings of the Fourteenth Workshop on the Algorithmic Foundations of Robotics 14, Springer International Publishing, pp.\u00a0551\u2013566 (2021)","DOI":"10.1007\/978-3-030-66723-8_33"},{"key":"2952_CR37","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1177\/0278364918784361","volume":"38","author":"DM Rosen","year":"2019","unstructured":"Rosen, D.M., Carlone, L., Bandeira, A.S., Leonard, J.J.: Se-sync: A certifiably correct algorithm for synchronization over the special euclidean group. Int. J. Robot. Res. 38, 95\u2013125 (2019)","journal-title":"Int. J. Robot. Res."},{"key":"2952_CR38","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1080\/02331934.2020.1823387","volume":"71","author":"M Souto","year":"2022","unstructured":"Souto, M., Garcia, J.D., Veiga, \u00c1.: Exploiting low-rank structure in semidefinite programming by approximate operator splitting. Optimization 71, 117\u2013144 (2022)","journal-title":"Optimization"},{"key":"2952_CR39","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1080\/10556788.2019.1576176","volume":"35","author":"D Sun","year":"2020","unstructured":"Sun, D., Toh, K.-C., Yuan, Y., Zhao, X.-Y.: SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0). Optim. Methods Softw. 35, 87\u2013115 (2020)","journal-title":"Optim. Methods Softw."},{"key":"2952_CR40","doi-asserted-by":"crossref","unstructured":"Tang, T., Toh, K.-C.: A feasible method for general convex low-rank sdp problems, SIAM Journal on Optimization, 34(3), 2169\u20132200 (2024)","DOI":"10.1137\/23M1561464"},{"key":"2952_CR41","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10107-023-01952-6","volume":"204","author":"T Tang","year":"2024","unstructured":"Tang, T., Toh, K.-C.: Solving graph equipartition SDPs on an algebraic variety. Math. Program. 204, 299\u2013347 (2024)","journal-title":"Math. Program."},{"key":"2952_CR42","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"K-C 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, 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"key":"2952_CR43","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38, 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"2952_CR44","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1137\/20M1323564","volume":"31","author":"J Wang","year":"2021","unstructured":"Wang, J., Magron, V., Lasserre, J.-B.: Chordal-TSSOS: A moment-SOS hierarchy that exploits term sparsity with chordal extension. SIAM J. Optim. 31, 114\u2013141 (2021)","journal-title":"SIAM J. Optim."},{"key":"2952_CR45","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/19M1307871","volume":"31","author":"J Wang","year":"2021","unstructured":"Wang, J., Magron, V., Lasserre, J.-B.: TSSOS: A moment-SOS hierarchy that exploits term sparsity. SIAM J. Optim. 31, 30\u201358 (2021)","journal-title":"SIAM J. Optim."},{"key":"2952_CR46","doi-asserted-by":"crossref","unstructured":"Wang, J., Magron, V., Lasserre, J.-B., Mai, N.H.A.: CS-TSSOS: Correlative and term sparsity for largescale polynomial optimization, ACM Transactions on Mathematical Software, 48(4), 1\u201326 (2022)","DOI":"10.1145\/3569709"},{"key":"2952_CR47","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1137\/22M1474539","volume":"33","author":"Y Wang","year":"2023","unstructured":"Wang, Y., Deng, K., Liu, H., Wen, Z.: A decomposition augmented lagrangian method for low-rank semidefinite programming. SIAM J. Optim. 33, 1361\u20131390 (2023)","journal-title":"SIAM J. Optim."},{"key":"2952_CR48","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, 203\u2013230 (2010)","journal-title":"Math. Program. Comput."},{"key":"2952_CR49","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of semidefinite programming: theory, algorithms, and applications, vol.\u00a027, Springer Science & Business Media, (2012)"},{"key":"2952_CR50","doi-asserted-by":"crossref","unstructured":"Yang, H., Carlone, L.: A quaternion-based certifiably optimal solution to the wahba problem with outliers, in Proceedings of the IEEE\/CVF International Conference on Computer Vision, pp.\u00a01665\u20131674 (2019)","DOI":"10.1109\/ICCV.2019.00175"},{"key":"2952_CR51","doi-asserted-by":"crossref","unstructured":"Yang, H., Carlone, L.: Certifiably optimal outlier-robust geometric perception: Semidefinite relaxations and scalable global optimization, IEEE Transactions on Pattern Analysis and Machine Intelligence, (2022)","DOI":"10.1109\/TPAMI.2022.3179463"},{"key":"2952_CR52","doi-asserted-by":"crossref","unstructured":"Yang, H., Liang, L., Carlone, L., Toh, K.-C.: An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, Math. Program., pp.\u00a01\u201364 (2022)","DOI":"10.1007\/s10107-022-01912-6"},{"key":"2952_CR53","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1109\/TRO.2020.3033695","volume":"37","author":"H Yang","year":"2020","unstructured":"Yang, H., Shi, J., Carlone, L.: Teaser: Fast and certifiable point cloud registration. IEEE Trans. Rob. 37, 314\u2013333 (2020)","journal-title":"IEEE Trans. Rob."},{"key":"2952_CR54","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s12532-015-0082-6","volume":"7","author":"L Yang","year":"2015","unstructured":"Yang, L., Sun, D., Toh, K.-C.: SDPNAL+: a majorized semismooth Newton-CG augmented lagrangian method for semidefinite programming with nonnegative constraints. Math. Program. Comput. 7, 331\u2013366 (2015)","journal-title":"Math. Program. Comput."},{"key":"2952_CR55","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1137\/19M1305045","volume":"3","author":"A Yurtsever","year":"2021","unstructured":"Yurtsever, A., Tropp, J.A., Fercoq, O., Udell, M., Cevher, V.: Scalable semidefinite programming. SIAM Journal on Mathematics of Data Science 3, 171\u2013200 (2021)","journal-title":"SIAM Journal on Mathematics of Data Science"},{"key":"2952_CR56","doi-asserted-by":"crossref","unstructured":"Zhang, R.Y., Lavaei, J.: Modified interior-point method for large-and-sparse low-rank semidefinite programs, in 2017 IEEE 56th Annual Conference on Decision and Control (CDC), IEEE, pp.\u00a05640\u20135647 (2017)","DOI":"10.1109\/CDC.2017.8264510"},{"key":"2952_CR57","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-020-01516-y","volume":"188","author":"RY Zhang","year":"2021","unstructured":"Zhang, R.Y., Lavaei, J.: Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion. Math. Program. 188, 351\u2013393 (2021)","journal-title":"Math. Program."},{"key":"2952_CR58","doi-asserted-by":"crossref","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, 489\u2013532 (2020)","journal-title":"Math. Program."},{"key":"2952_CR59","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-022-01898-1","volume":"201","author":"Y Zhou","year":"2022","unstructured":"Zhou, Y., Bao, C., Ding, C., Zhu, J.: A semismooth newton based augmented lagrangian method for nonsmooth optimization on matrix manifolds. Math. Program. 201, 1\u201361 (2022)","journal-title":"Math. Program."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02952-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02952-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02952-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T06:41:32Z","timestamp":1750315292000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02952-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,31]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2952"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02952-8","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,31]]},"assertion":[{"value":"6 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"33"}}