{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:36Z","timestamp":1781305056878,"version":"3.54.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_17","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:20Z","timestamp":1781303660000},"page":"249-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Approximation Algorithms for\u00a0Orthogonally Constrained Problems Using Semidefinite Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4485-0619","authenticated-orcid":false,"given":"Ryan","family":"Cory-Wright","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6352-0984","authenticated-orcid":false,"given":"Jean","family":"Pauphilet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Bandeira, A.S., Kennedy, C., Singer, A.: Approximating the little Grothendieck problem over the orthogonal and unitary groups. Math. Program. 160, 433\u2013475 (2016)","DOI":"10.1007\/s10107-016-0993-7"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s004540010074","volume":"25","author":"A Barvinok","year":"2001","unstructured":"Barvinok, A.: A remark on the rank of positive semidefinite matrices subject to affine constraints. Discrete Comput. Geom. 25(1), 23\u201331 (2001)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/1345448.1345465","volume":"9","author":"RM Bell","year":"2007","unstructured":"Bell, R.M., Koren, Y.: Lessons from the Netflix prize challenge. ACM SIGKDD Explor. Newsl. 9(2), 75\u201379 (2007)","journal-title":"ACM SIGKDD Explor. Newsl."},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1137\/S1052623400374756","volume":"12","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., Nemirovski, A.: On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty. SIAM J. Optim. 12(3), 811\u2013833 (2002)","journal-title":"SIAM J. Optim."},{"issue":"29","key":"17_CR5","first-page":"1","volume":"18","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas, D., Copenhaver, M.S., Mazumder, R.: Certifiably optimal low rank factor analysis. J. Mach. Learn. Res. 18(29), 1\u201353 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"6","key":"17_CR6","doi-asserted-by":"publisher","first-page":"3321","DOI":"10.1287\/opre.2021.2182","volume":"70","author":"D Bertsimas","year":"2022","unstructured":"Bertsimas, D., Cory-Wright, R., Pauphilet, J.: Mixed-projection conic optimization: a new paradigm for modeling rank constraints. Oper. Res. 70(6), 3321\u20133344 (2022)","journal-title":"Oper. Res."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., Ye, Y.: Semidefinite relaxations, multivariate normal distributions, and order statistics. In: Handbook of Combinatorial Optimization, pp. 1473\u20131491. Springer (1998)","DOI":"10.1007\/978-1-4613-0303-9_24"},{"issue":"1\u20133","key":"17_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0024-3795(97)00230-9","volume":"269","author":"M Bolla","year":"1998","unstructured":"Bolla, M., Michaletzky, G., Tusn\u00e1dy, G., Ziermann, M.: Extrema of sums of heterogeneous quadratic forms. Linear Algebra Appl. 269(1\u20133), 331\u2013365 (1998)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/s00220-011-1280-3","volume":"305","author":"J Bri\u00ebt","year":"2011","unstructured":"Bri\u00ebt, J., Buhrman, H., Toner, B.: A generalized Grothendieck inequality and nonlocal correlations that require high entanglement. Commun. Math. Phys. 305(3), 827\u2013843 (2011)","journal-title":"Commun. Math. Phys."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Bri\u00ebt, J., de\u00a0Oliveira\u00a0Filho, F.M., Vallentin, F.: The positive semidefinite Grothendieck problem with rank constraint. In: International Colloquium on Automata, Languages, and Programming, pp. 31\u201342. Springer (2010)","DOI":"10.1007\/978-3-642-14165-2_4"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Bri\u00ebt, J., Regev, O., Saket, R.: Tight hardness of the non-commutative Grothendieck problem. In: IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 1108\u20131122. IEEE (2015)","DOI":"10.1109\/FOCS.2015.72"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/s10957-023-02168-6","volume":"202","author":"S Burer","year":"2024","unstructured":"Burer, S., Park, K.: A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold. J. Optim. Theory Appl. 202(1), 320\u2013339 (2024)","journal-title":"J. Optim. Theory Appl."},{"key":"17_CR13","unstructured":"Dong, H., Chen, K., Linderoth, J.: Regularization vs. relaxation: a conic optimization perspective of statistical variable selection. arXiv preprint arXiv:1510.06083 (2015)"},{"key":"17_CR14","unstructured":"d\u2019Aspremont, A., Boyd, S.: Relaxations and randomized methods for nonconvex QCQPs. EE392o Class Notes, Stanford University, vol. 1, pp. 1\u201316 (2003)"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1137\/23M1545136","volume":"46","author":"K Gilman","year":"2025","unstructured":"Gilman, K., Burer, S., Balzano, L.: A semidefinite relaxation for sums of heterogeneous quadratics on the Stiefel manifold. SIAM J. Matrix Anal. Appl. 46(2), 1091\u20131116 (2025)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"6","key":"17_CR16","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM (JACM) 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM (JACM)"},{"key":"17_CR17","unstructured":"Grimmett, G., Stirzaker, D.: Probability and Random Processes. Oxford University Press (2020)"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Lai, Z., Lim, L.H., Tang, T.: Stiefel optimization is NP-hard. Optim. Lett. (2026). https:\/\/doi.org\/10.1007\/s11590-025-02271-9","DOI":"10.1007\/s11590-025-02271-9"},{"issue":"3","key":"17_CR19","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/MSP.2010.936019","volume":"27","author":"ZQ 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(3), 20\u201334 (2010)","journal-title":"IEEE Signal Process. Mag."},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.4086\/toc.2014.v010a011","volume":"10","author":"A Naor","year":"2014","unstructured":"Naor, A., Regev, O., Vidick, T.: Efficient rounding for the noncommutative Grothendieck inequality. Theory Comput. 10(1), 257\u2013295 (2014)","journal-title":"Theory Comput."},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1214\/10-AOS850","volume":"39","author":"S Negahban","year":"2011","unstructured":"Negahban, S., Wainwright, M.J.: Estimation of (near) low-rank matrices with noise and high-dimensional scaling. Ann. Stat. 39, 1069\u20131097 (2011)","journal-title":"Ann. Stat."},{"issue":"2\u20133","key":"17_CR22","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10107-006-0033-0","volume":"109","author":"A Nemirovski","year":"2007","unstructured":"Nemirovski, A.: Sums of random symmetric matrices and quadratic optimization under orthogonality constraints. Math. Program. 109(2\u20133), 283\u2013317 (2007)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"17_CR23","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1080\/10556789808805690","volume":"9","author":"Y Nesterov","year":"1998","unstructured":"Nesterov, Y.: Semidefinite relaxation and nonconvex quadratic optimization. Optim. Methods Softw. 9(1\u20133), 141\u2013160 (1998)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.23.2.339","volume":"23","author":"G Pataki","year":"1998","unstructured":"Pataki, G.: On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. 23(2), 339\u2013358 (1998)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"17_CR25","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s12532-023-00236-6","volume":"15","author":"D Rehfeldt","year":"2023","unstructured":"Rehfeldt, D., Koch, T., Shinano, Y.: Faster exact solution of sparse MaxCut and QUBO problems. Math. Program. Comput. 15(3), 445\u2013470 (2023)","journal-title":"Math. Program. Comput."},{"key":"17_CR26","first-page":"1","volume":"25","author":"NZ Shor","year":"1987","unstructured":"Shor, N.Z.: Quadratic optimization problems. Sov. J. Comput. Syst. Sci. 25, 1\u201311 (1987)","journal-title":"Sov. J. Comput. Syst. Sci."},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"So, A.M.C.: Improved approximation bound for quadratic optimization problems with orthogonality constraints. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1201\u20131209. SIAM (2009)","DOI":"10.1137\/1.9781611973068.130"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"},{"key":"17_CR29","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, vol.\u00a027. Springer (1998)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:23Z","timestamp":1781303663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}