{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T04:01:13Z","timestamp":1748923273382,"version":"3.41.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001866","name":"National Research Fund","doi-asserted-by":"crossref","award":["NRF 2021-R1A2C1003810"],"award-info":[{"award-number":["NRF 2021-R1A2C1003810"]}],"id":[{"id":"10.13039\/501100001866","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JSPS KAKENHI Grant Number JP20H04145","JSPS KAKENHI Grant Numbers JP22KJ1307","JSPS KAKENHI Grant Numbers JP24K20738"],"award-info":[{"award-number":["JSPS KAKENHI Grant Number JP20H04145","JSPS KAKENHI Grant Numbers JP22KJ1307","JSPS KAKENHI Grant Numbers JP24K20738"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10898-025-01478-5","type":"journal-article","created":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T00:02:31Z","timestamp":1742601751000},"page":"321-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rank-one matrix completion via high-rank matrices in sum-of-squares relaxations"],"prefix":"10.1007","volume":"92","author":[{"given":"Godai","family":"Azuma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunyoung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,21]]},"reference":[{"key":"1478_CR1","volume-title":"Elementary Linear Algebra: Applications Version","author":"H Anton","year":"2014","unstructured":"Anton, H., Rorres, C.: Elementary Linear Algebra: Applications Version, 11th edn. Wiley, USA (2014)","edition":"11"},{"key":"1478_CR2","unstructured":"Argue, C.\u00a0J., K\u0131l\u0131n\u00e7-Karzan, F., Wang, A.\u00a0L.: Necessary and sufficient conditions for rank-one generated cones. arXiv:2007.07433, (2020)"},{"issue":"3","key":"1478_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10994-007-5040-8","volume":"73","author":"A Argyriou","year":"2008","unstructured":"Argyriou, A., Evgeniou, T., Ponti, M.: Convex multi-task feature learning. Mach. Learn. 73(3), 243\u2013272 (2008)","journal-title":"Mach. Learn."},{"issue":"2","key":"1478_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10898-021-01071-6","volume":"82","author":"G Azuma","year":"2022","unstructured":"Azuma, G., Fukuda, M., Kim, S., Yamashita, M.: Exact SDP relaxations of quadratically constrained quadratic programs with forest structures. J. Glob. Optim. 82(2), 243\u2013262 (2022)","journal-title":"J. Glob. Optim."},{"key":"1478_CR5","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s10898-022-01268-3","volume":"86","author":"G Azuma","year":"2023","unstructured":"Azuma, G., Fukuda, M., Kim, S., Yamashita, M.: Exact SDP relaxations for quadratic programs with bipartite graph structures. J. Glob. Optim. 86, 671\u2013691 (2023)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1478_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01367-2","volume":"181","author":"S Burer","year":"2020","unstructured":"Burer, S., Ye, Y.: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Math. Program. 181(1), 1\u201317 (2020)","journal-title":"Math. Program."},{"issue":"4","key":"1478_CR7","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1478_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/151005099","volume":"57","author":"EJ Cand\u00e8s","year":"2015","unstructured":"Cand\u00e8s, E.J., Eldar, Y.C., Strohmer, T., Voroninski, V.: Phase retrieval via matrix completion. SIAM Rev. 57(2), 225\u2013251 (2015)","journal-title":"SIAM Rev."},{"issue":"6","key":"1478_CR9","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"8","key":"1478_CR10","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J.K., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math: J. Issued Courant Inst. Math. Sci. 59(8), 1207\u20131223 (2006)","journal-title":"Commun. Pure Appl. Math: J. Issued Courant Inst. Math. Sci."},{"issue":"5","key":"1478_CR11","doi-asserted-by":"publisher","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(5), 2053\u20132080 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1478_CR12","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MSP.2018.2821706","volume":"35","author":"Y Chen","year":"2018","unstructured":"Chen, Y., Chi, Y.: Harnessing structures in big data via guaranteed low-rank matrix estimation: Recent theory and fast algorithms via convex and nonconvex optimization. IEEE Sign. Process. Mag. 35(4), 14\u201331 (2018)","journal-title":"IEEE Sign. Process. Mag."},{"issue":"2","key":"1478_CR13","first-page":"103","volume":"58","author":"MD Choi","year":"1995","unstructured":"Choi, M.D., Lam, T.Y., Reznick, B.: Sums of squares of real polynomials. Proc. Symp. Pure Math. 58(2), 103\u2013126 (1995)","journal-title":"Proc. Symp. Pure Math."},{"key":"1478_CR14","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/s10208-020-09471-y","volume":"21","author":"A Cosse","year":"2021","unstructured":"Cosse, A., Demanet, L.: Stable rank-one matrix completion is solved by the level 2 Lasserre relaxation. Found. Comput. Math. 21, 891\u2013940 (2021)","journal-title":"Found. Comput. Math."},{"issue":"4","key":"1478_CR15","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inform. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"1478_CR16","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."},{"issue":"19","key":"1478_CR17","doi-asserted-by":"publisher","first-page":"5004","DOI":"10.1109\/TSP.2019.2932875","volume":"67","author":"P Gim\u00e9nez-Febrer","year":"2019","unstructured":"Gim\u00e9nez-Febrer, P., Pag\u00e8s-Zamora, A., Giannakis, G.B.: Matrix completion and extrapolation via kernel regression. IEEE Trans. Sign. Process. 67(19), 5004\u20135017 (2019)","journal-title":"IEEE Trans. Sign. Process."},{"key":"1478_CR18","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1109\/LSP.2020.2970306","volume":"27","author":"P Gim\u00e9nez-Febrer","year":"2020","unstructured":"Gim\u00e9nez-Febrer, P., Pag\u00e8s-Zamora, A., Giannakis, G.B.: Generalization error bounds for kernel matrix completion and extrapolation. IEEE Sign. Process. Lett. 27, 326\u2013330 (2020)","journal-title":"IEEE Sign. Process. Lett."},{"issue":"5","key":"1478_CR19","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1007\/s10208-018-09410-y","volume":"19","author":"S Gribling","year":"2019","unstructured":"Gribling, S., de Laat, D., Laurent, M.: Lower bounds on matrix factorization ranks via noncommutative polynomial optimization. Found. Comput. Math. 19(5), 1013\u20131070 (2019)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"1478_CR20","doi-asserted-by":"publisher","first-page":"1548","DOI":"10.1109\/TIT.2011.2104999","volume":"57","author":"D Gross","year":"2011","unstructured":"Gross, D.: Recovering low-rank matrices from few coefficients in any basis. IEEE Trans. Inf. Theory 57(3), 1548\u20131566 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1478_CR21","doi-asserted-by":"publisher","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"RH Keshavan","year":"2010","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from a few entries. IEEE Trans. Inf. Theory 56(6), 2980\u20132998 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1478_CR22","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1025794313696","volume":"26","author":"S Kim","year":"2003","unstructured":"Kim, S., Kojima, M.: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations. Comput. Optim. Appl. 26(2), 143\u2013154 (2003)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1478_CR23","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-010-0402-6","volume":"129","author":"S Kim","year":"2011","unstructured":"Kim, S., Kojima, M., Mevissen, M., Yamashita, M.: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion. Math. Program. 129(1), 33\u201368 (2011)","journal-title":"Math. Program."},{"issue":"3","key":"1478_CR24","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/030601260","volume":"15","author":"S Kim","year":"2005","unstructured":"Kim, S., Kojima, M., Waki, H.: Generalized Lagrangian duals and sums of squares relaxations of sparse polynomial optimization problems. SIAM J. Optim. 15(3), 697\u2013719 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1478_CR25","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1137\/080713380","volume":"20","author":"S Kim","year":"2009","unstructured":"Kim, S., Kojima, M., Waki, H.: Exploiting sparsity in SDP relaxation for sensor network localization. SIAM J. Optim. 20(1), 192\u2013215 (2009)","journal-title":"SIAM J. Optim."},{"key":"1478_CR26","first-page":"1391","volume":"16","author":"FJ Kir\u00e1ly","year":"2015","unstructured":"Kir\u00e1ly, F.J., Theran, L., Tomioka, R.: The algebraic combinatorial approach for low-rank matrix completion. J. Mach. Learn. Res. 16, 1391\u20131436 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1478_CR27","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10107-020-01526-w","volume":"190","author":"M Ko\u010dvara","year":"2021","unstructured":"Ko\u010dvara, M.: Decomposition of arrow type positive semidefinite matrices with application to topology optimization. Math. Program. 190(1), 105\u2013134 (2021)","journal-title":"Math. Program."},{"issue":"2","key":"1478_CR28","first-page":"125","volume":"46","author":"M Kojima","year":"2003","unstructured":"Kojima, M., Kim, S., Waki, H.: A general framework for convex relaxation of polynomial optimization problems over cones. J. Operat. Res. Soc. Jpn. 46(2), 125\u2013144 (2003)","journal-title":"J. Operat. Res. Soc. Jpn."},{"issue":"1","key":"1478_CR29","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s10107-023-01993-x","volume":"205","author":"M Korda","year":"2024","unstructured":"Korda, M., Laurent, M., Magron, V., Steenkamp, A.: Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks. Math. Program. 205(1), 703\u2013744 (2024)","journal-title":"Math. Program."},{"issue":"3","key":"1478_CR30","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"1478_CR31","doi-asserted-by":"crossref","DOI":"10.1142\/q0382","volume-title":"Sparse Polynomial Optimization: Theory and Practice. Optimization and its Applications","author":"V Magron","year":"2023","unstructured":"Magron, V., Wang, J.: Sparse Polynomial Optimization: Theory and Practice. Optimization and its Applications, vol. 5. World Scientific Publishing Europe Ltd., London (2023)"},{"issue":"2","key":"1478_CR32","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."},{"issue":"2","key":"1478_CR33","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/0021-9991(90)90177-3","volume":"90","author":"DP O\u2019Leary","year":"1990","unstructured":"O\u2019Leary, D.P., Stewart, G.W.: Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices. J. Comput. Phys. 90(2), 497\u2013505 (1990)","journal-title":"J. Comput. Phys."},{"issue":"2","key":"1478_CR34","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"PA Parrilo","year":"2003","unstructured":"Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2), 293\u2013320 (2003)","journal-title":"Math. Program."},{"issue":"11","key":"1478_CR35","doi-asserted-by":"publisher","first-page":"6535","DOI":"10.1109\/TIT.2016.2598574","volume":"62","author":"R Sun","year":"2016","unstructured":"Sun, R., Luo, Z.-Q.: Guaranteed matrix completion via non-convex factorization. IEEE Trans. Inf. Theory 62(11), 6535\u20136579 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1478_CR36","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-020-01589-9","volume":"193","author":"AL Wang","year":"2021","unstructured":"Wang, A.L., K\u0131l\u0131n\u00e7-Karzan, F.: On the tightness of SDP relaxations of QCQPs. Math. Program. 193(1), 33\u201373 (2021)","journal-title":"Math. Program."},{"issue":"1","key":"1478_CR37","doi-asserted-by":"publisher","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(1), 30\u201358 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1478_CR38","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s11263-005-4939-z","volume":"70","author":"KQ Weinberger","year":"2006","unstructured":"Weinberger, K.Q., Saul, L.K.: Unsupervised learning of image manifolds by semidefinite programming. Int. J. Comput. Vis. 70(1), 77\u201390 (2006)","journal-title":"Int. J. Comput. Vis."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01478-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-025-01478-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01478-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T06:28:45Z","timestamp":1748845725000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-025-01478-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,21]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1478"],"URL":"https:\/\/doi.org\/10.1007\/s10898-025-01478-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2025,3,21]]},"assertion":[{"value":"24 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2025","order":3,"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 conflict of interest to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}