{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T01:14:13Z","timestamp":1728177253351},"reference-count":92,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:00:00Z","timestamp":1669680000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:00:00Z","timestamp":1669680000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"ARL DCIST CRA","award":["W911NF-17-2-0181"]},{"name":"NSF CAREER","award":["\u201cCertifiable Perception for Autonomous Cyber-Physical Systems\u201d"]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education, Singapore","doi-asserted-by":"crossref","award":["MOE-2019-T3-1-010"],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10107-022-01912-6","type":"journal-article","created":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T12:07:56Z","timestamp":1669723676000},"page":"409-472","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization"],"prefix":"10.1007","volume":"201","author":[{"given":"Heng","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0671-9561","authenticated-orcid":false,"given":"Ling","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Carlone","sequence":"additional","affiliation":[]},{"given":"Kim-Chuan","family":"Toh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,29]]},"reference":[{"issue":"1","key":"1912_CR1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/TIT.2015.2490670","volume":"62","author":"E Abbe","year":"2015","unstructured":"Abbe, E., Bandeira, A.S., Hall, G.: Exact recovery in the stochastic block model. IEEE Trans. Inf. Theory 62(1), 471\u2013487 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1912_CR2","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"PA Absil","year":"2009","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2009)"},{"key":"1912_CR3","doi-asserted-by":"crossref","unstructured":"Aholt, C., Agarwal, S., Thomas, R.: A QCQP approach to triangulation. In: European Conference on Computer Vision, pp. 654\u2013667. Springer (2012)","DOI":"10.1007\/978-3-642-33718-5_47"},{"issue":"1","key":"1912_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02614432","volume":"77","author":"F Alizadeh","year":"1997","unstructured":"Alizadeh, F., Haeberly, J.P.A., Overton, M.L.: Complementarity and nondegeneracy in semidefinite programming. Math. Program. 77(1), 111\u2013128 (1997)","journal-title":"Math. Program."},{"issue":"3","key":"1912_CR5","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/S1052623496304700","volume":"8","author":"F Alizadeh","year":"1998","unstructured":"Alizadeh, F., Haeberly, J.P.A., 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":"1912_CR6","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/TRO.2021.3094984","volume":"38","author":"P Antonante","year":"2021","unstructured":"Antonante, P., Tzoumas, V., Yang, H., Carlone, L.: Outlier-robust estimation: hardness, minimally-tuned algorithms, and applications. IEEE Trans. Robot. 38, 281\u2013301 (2021)","journal-title":"IEEE Trans. Robot."},{"key":"1912_CR7","unstructured":"ApS, M.: The MOSEK optimization toolbox for MATLAB manual. Version 9.0. (2019). http:\/\/docs.mosek.com\/9.0\/toolbox\/index.html"},{"key":"1912_CR8","doi-asserted-by":"crossref","unstructured":"Barak, B., Brandao, F.G., Harrow, A.W., Kelner, J., Steurer, D., Zhou, Y.: Hypercontractivity, sum-of-squares proofs, and their applications. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 307\u2013326 (2012)","DOI":"10.1145\/2213977.2214006"},{"key":"1912_CR9","doi-asserted-by":"crossref","unstructured":"Bay, H., Tuytelaars, T., Van\u00a0Gool, L.: Surf: speeded up robust features. In: European Conference on Computer Vision, pp. 404\u2013417. Springer (2006)","DOI":"10.1007\/11744023_32"},{"issue":"1","key":"1912_CR10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"1912_CR11","volume-title":"Nonlinear Programming","author":"D Bertsekas","year":"1999","unstructured":"Bertsekas, D.: Nonlinear Programming. Athena Scientific, Nashua (1999)"},{"key":"1912_CR12","volume-title":"Semidefinite Optimization and Convex Algebraic Geometry","author":"G Blekherman","year":"2020","unstructured":"Blekherman, G., Parrilo, P.A., Thomas, R.R.: Semidefinite Optimization and Convex Algebraic Geometry. SIAM, Philadelphia (2020)"},{"issue":"42","key":"1912_CR13","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(42), 1455\u20131459 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"1912_CR14","unstructured":"Boumal, N., Voroninski, V., Bandeira, A.S.: The non-convex Burer-Monteiro approach works on smooth semidefinite programs. In: Conference on Neural Information Processing Systems (NeurIPS) (2016)"},{"key":"1912_CR15","doi-asserted-by":"crossref","unstructured":"Briales, J., Gonzalez-Jimenez, J.: Convex global 3d registration with Lagrangian duality. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4960\u20134969 (2017)","DOI":"10.1109\/CVPR.2017.595"},{"issue":"2","key":"1912_CR16","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(2), 329\u2013357 (2003)","journal-title":"Math. Program."},{"key":"1912_CR17","doi-asserted-by":"crossref","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\u201317 (2020)","journal-title":"Math. Program."},{"issue":"2","key":"1912_CR18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/151005099","volume":"57","author":"EJ Candes","year":"2015","unstructured":"Candes, 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."},{"key":"1912_CR19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10107-016-1007-5","volume":"161","author":"L Chen","year":"2017","unstructured":"Chen, L., Sun, D., Toh, K.: An efficient inexact symmetric Gauss\u2013Seidel based majorized ADMM for high-dimensional convex composite conic programming. Math. Program. 161, 237\u2013270 (2017)","journal-title":"Math. Program."},{"issue":"2","key":"1912_CR20","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(2), 708\u2013729 (2021)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1912_CR21","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":"1912_CR22","doi-asserted-by":"crossref","unstructured":"Combettes, P.L., Pesquet, J.C.: Proximal splitting methods in signal processing. In: Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185\u2013212. Springer (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"issue":"1","key":"1912_CR23","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(1), 381\u2013415 (2019)","journal-title":"Math. Program."},{"issue":"1","key":"1912_CR24","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"YH Dai","year":"1999","unstructured":"Dai, Y.H., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10(1), 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1912_CR25","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10100-007-0052-9","volume":"16","author":"E De Klerk","year":"2008","unstructured":"De Klerk, E.: The complexity of optimizing over a simplex, hypercube or sphere: a short survey. CEJOR 16(2), 111\u2013125 (2008)","journal-title":"CEJOR"},{"issue":"2","key":"1912_CR26","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.69.022308","volume":"69","author":"AC Doherty","year":"2004","unstructured":"Doherty, A.C., Parrilo, P.A., Spedalieri, F.M.: Complete family of separability criteria. Phys. Rev. A 69(2), 022308 (2004)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"1912_CR27","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"1912_CR28","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10107-020-01537-7","volume":"190","author":"K Fang","year":"2020","unstructured":"Fang, K., Fawzi, H.: The sum-of-squares hierarchy on the sphere and applications in quantum information theory. Math. Program. 190, 331\u2013360 (2020)","journal-title":"Math. Program."},{"issue":"3","key":"1912_CR29","doi-asserted-by":"crossref","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":"1912_CR30","unstructured":"Gamarnik, D., K\u0131z\u0131lda\u011f, E.C.: Algorithmic obstructions in the random number partitioning problem. arXiv preprint arXiv:2103.01369 (2021)"},{"issue":"6","key":"1912_CR31","doi-asserted-by":"crossref","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)"},{"issue":"2","key":"1912_CR32","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1009898604624","volume":"4","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F., Weismantel, R.: A semidefinite programming approach to the quadratic knapsack problem. J. Comb. Optim. 4(2), 197\u2013215 (2000)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"1912_CR33","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/779359.779363","volume":"29","author":"D Henrion","year":"2003","unstructured":"Henrion, D., Lasserre, J.B.: GloptiPoly: global optimization over polynomials with Matlab and SeDuMi. ACM Trans. Math. Softw. (TOMS) 29(2), 165\u2013194 (2003)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"1","key":"1912_CR34","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/10556780903191165","volume":"26","author":"D Henrion","year":"2011","unstructured":"Henrion, D., Malick, J.: Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions. Optim. Methods Softw. 26(1), 23\u201346 (2011)","journal-title":"Optim. Methods Softw."},{"key":"1912_CR35","doi-asserted-by":"crossref","unstructured":"Henrion, D., Malick, J.: Projection methods in conic optimization. In: Handbook on Semidefinite, Conic and Polynomial Optimization, pp. 565\u2013600 (2012)","DOI":"10.1007\/978-1-4614-0769-0_20"},{"issue":"3","key":"1912_CR36","doi-asserted-by":"crossref","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":"1912_CR37","unstructured":"Inc., W.R.: Mathematica, Version 12.2. https:\/\/www.wolfram.com\/mathematica. Champaign, IL (2020)"},{"issue":"3","key":"1912_CR38","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1137\/110847081","volume":"22","author":"K Jiang","year":"2012","unstructured":"Jiang, K., Sun, D., Toh, K.C.: An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP. SIAM J. Optim. 22(3), 1042\u20131064 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1912_CR39","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s11590-015-0868-5","volume":"10","author":"C Josz","year":"2016","unstructured":"Josz, C., Henrion, D.: Strong duality in Lasserre\u2019s hierarchy for polynomial optimization. Optim. Lett. 10(1), 3\u201310 (2016)","journal-title":"Optim. Lett."},{"key":"1912_CR40","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Yang, Z., Zhi, L.: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. In: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, pp. 169\u2013176 (2006)","DOI":"10.1145\/1145768.1145799"},{"key":"1912_CR41","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programs. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 293\u2013303. Springer (2001)","DOI":"10.1007\/3-540-45535-3_23"},{"issue":"3","key":"1912_CR42","doi-asserted-by":"crossref","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":"1912_CR43","doi-asserted-by":"crossref","DOI":"10.1142\/p665","volume-title":"Moments, Positive Polynomials and Their Applications","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J.B.: Moments, Positive Polynomials and Their Applications, vol. 1. World Scientific, Singapore (2009)"},{"issue":"1","key":"1912_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-004-0561-4","volume":"109","author":"M Laurent","year":"2007","unstructured":"Laurent, M.: Semidefinite representations for finite varieties. Math. Program. 109(1), 1\u201326 (2007)","journal-title":"Math. Program."},{"issue":"1","key":"1912_CR45","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10107-018-1247-7","volume":"175","author":"X Li","year":"2019","unstructured":"Li, X., Sun, D., Toh, K.C.: A block symmetric Gauss\u2013Seidel decomposition theorem for convex composite quadratic programming and its applications. Math. Program. 175(1), 395\u2013418 (2019)","journal-title":"Math. Program."},{"issue":"3","key":"1912_CR46","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1137\/080729104","volume":"20","author":"C Ling","year":"2010","unstructured":"Ling, C., Nie, J., Qi, L., Ye, Y.: Biquadratic optimization over unit spheres and semidefinite programming relaxations. SIAM J. Optim. 20(3), 1286\u20131310 (2010)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1912_CR47","doi-asserted-by":"crossref","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."},{"key":"1912_CR48","unstructured":"Mai, N.H.A., Magron, V., Lasserre, J.B.: A hierarchy of spectral relaxations for polynomial optimization. arXiv preprint arXiv:2007.09027 (2020)"},{"issue":"1","key":"1912_CR49","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/S0895479802413856","volume":"26","author":"J Malick","year":"2004","unstructured":"Malick, J.: A dual approach to semidefinite least-squares problems. SIAM J. Matrix Anal. Appl. 26(1), 272\u2013284 (2004)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"1912_CR50","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1137\/070704575","volume":"20","author":"J Malick","year":"2009","unstructured":"Malick, J., Povh, J., Rendl, F., Wiegele, A.: Regularization methods for semidefinite programming. SIAM J. Optim. 20(1), 336\u2013356 (2009)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1912_CR51","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s11228-005-0005-1","volume":"14","author":"J Malick","year":"2006","unstructured":"Malick, J., Sendov, H.S.: Clarke generalized Jacobian of the projection onto the cone of positive semidefinite matrices. Set-Valued Anal. 14(3), 273\u2013293 (2006)","journal-title":"Set-Valued Anal."},{"issue":"4","key":"1912_CR52","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(4), 891\u2013909 (2008)","journal-title":"Automatica"},{"key":"1912_CR53","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.cam.2013.07.048","volume":"256","author":"I Markovsky","year":"2014","unstructured":"Markovsky, I., Usevich, K.: Software for weighted structured low-rank approximation. J. Comput. Appl. Math. 256, 278\u2013292 (2014)","journal-title":"J. Comput. Appl. Math."},{"issue":"10","key":"1912_CR54","doi-asserted-by":"crossref","first-page":"2283","DOI":"10.1016\/j.sigpro.2007.04.004","volume":"87","author":"I Markovsky","year":"2007","unstructured":"Markovsky, I., Van Huffel, S.: Overview of total least-squares methods. Signal Process. 87(10), 2283\u20132302 (2007)","journal-title":"Signal Process."},{"key":"1912_CR55","doi-asserted-by":"crossref","unstructured":"Meneghetti, G., Danelljan, M., Felsberg, M., Nordberg, K.: Image alignment for panorama stitching in sparsely structured environments. In: Scandinavian Conference on Image Analysis, pp. 428\u2013439. Springer (2015)","DOI":"10.1007\/978-3-319-19665-7_36"},{"key":"1912_CR56","unstructured":"Mertens, S.: Number partitioning. In: Computational Complexity and Statistical Physics, p. 125 (2006)"},{"key":"1912_CR57","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on convex optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on convex optimization, vol. 137. Springer, Berlin (2018)"},{"issue":"3","key":"1912_CR58","doi-asserted-by":"crossref","first-page":"1634","DOI":"10.1137\/120898772","volume":"23","author":"J Nie","year":"2013","unstructured":"Nie, J.: Polynomial optimization with real varieties. SIAM J. Optim. 23(3), 1634\u20131646 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1912_CR59","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10107-013-0680-x","volume":"146","author":"J Nie","year":"2014","unstructured":"Nie, J.: Optimality conditions and finite convergence of Lasserre\u2019s hierarchy. Math. Program. 146(1), 97\u2013121 (2014)","journal-title":"Math. Program."},{"key":"1912_CR60","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, Berlin (2006)"},{"issue":"2","key":"1912_CR61","doi-asserted-by":"crossref","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":"2","key":"1912_CR62","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1137\/050624509","volume":"28","author":"H Qi","year":"2006","unstructured":"Qi, H., Sun, D.: A quadratically convergent newton method for computing the nearest correlation matrix. SIAM J. Matrix Anal. Appl. 28(2), 360\u2013385 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1912_CR63","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970524","volume-title":"Conjugate Duality and Optimization","author":"RT Rockafellar","year":"1974","unstructured":"Rockafellar, R.T.: Conjugate Duality and Optimization. SIAM, Philadelphia (1974)"},{"issue":"2","key":"1912_CR64","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(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"1912_CR65","doi-asserted-by":"crossref","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":"1912_CR66","doi-asserted-by":"crossref","unstructured":"Rosen, D.M.: Scalable low-rank semidefinite programming for certifiably correct machine perception. In: Inernational Workshop on the Algorithmic Foundations of Robotics (WAFR), vol.\u00a03 (2020)","DOI":"10.1007\/978-3-030-66723-8_33"},{"issue":"2\u20133","key":"1912_CR67","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(2\u20133), 95\u2013125 (2019)","journal-title":"Int. J. Robot. Res."},{"issue":"1","key":"1912_CR68","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1137\/S0895479893258802","volume":"17","author":"JB Rosen","year":"1996","unstructured":"Rosen, J.B., Park, H., Glick, J.: Total least norm formulation and solution for structured problems. SIAM J. Matrix Anal. Appl. 17(1), 110\u2013126 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1912_CR69","doi-asserted-by":"crossref","unstructured":"Rusu, R., Blodow, N., Beetz, M.: Fast point feature histograms (FPFH) for 3d registration. In: IEEE International Conference on Robotics and Automation (ICRA), pp. 3212\u20133217. Citeseer (2009)","DOI":"10.1109\/ROBOT.2009.5152473"},{"key":"1912_CR70","doi-asserted-by":"crossref","unstructured":"Shi, J., Yang, H., Carlone, L.: Optimal pose and shape estimation for category-level 3d object perception. In: Robotics: Science and Systems (RSS) (2021)","DOI":"10.15607\/RSS.2021.XVII.025"},{"key":"1912_CR71","doi-asserted-by":"crossref","unstructured":"Shi, J., Yang, H., Carlone, L.: ROBIN: a graph-theoretic approach to reject outliers in robust estimation using invariants. In: IEEE International Conference on Robotics and Automation (ICRA) (2021)","DOI":"10.1109\/ICRA48506.2021.9562007"},{"issue":"1","key":"1912_CR72","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02283692","volume":"25","author":"NZ Shor","year":"1990","unstructured":"Shor, N.Z.: Dual quadratic estimates in polynomial and Boolean programming. Ann. Oper. Res. 25(1), 163\u2013168 (1990)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"1912_CR73","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1137\/140964357","volume":"25","author":"D Sun","year":"2015","unstructured":"Sun, D., Toh, K.C., Yang, L.: A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints. SIAM J. Optim. 25(2), 882\u2013915 (2015)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1912_CR74","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1137\/S1052623402419819","volume":"14","author":"KC Toh","year":"2004","unstructured":"Toh, K.C.: Solving large scale semidefinite programs via an iterative solver on the augmented systems. SIAM J. Optim. 14(3), 670\u2013698 (2004)","journal-title":"SIAM J. Optim."},{"issue":"1\u20134","key":"1912_CR75","first-page":"545","volume":"11","author":"KC 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(1\u20134), 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"key":"1912_CR76","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/050623802","volume":"17","author":"H Waki","year":"2006","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M.: Sums of squares and semidefinite programming relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17, 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"key":"1912_CR77","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-020-01589-9","volume":"193","author":"AL Wang","year":"2022","unstructured":"Wang, A.L., K\u0131l\u0131n\u00e7-Karzan, F.: On the tightness of SDP relaxations of QCQPs. Math. Program. 193, 33\u201373 (2022)","journal-title":"Math. Program."},{"issue":"1","key":"1912_CR78","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(1), 114\u2013141 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1912_CR79","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(1), 30\u201358 (2021)","journal-title":"SIAM J. Optim."},{"issue":"7","key":"1912_CR80","doi-asserted-by":"crossref","first-page":"2898","DOI":"10.1109\/TAC.2018.2872204","volume":"64","author":"G Wu","year":"2018","unstructured":"Wu, G., Sun, J., Chen, J.: Optimal linear quadratic regulator of switched systems. IEEE Trans. Autom. Control 64(7), 2898\u20132904 (2018)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"1912_CR81","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1109\/LRA.2020.2965893","volume":"5","author":"H Yang","year":"2020","unstructured":"Yang, H., Antonante, P., Tzoumas, V., Carlone, L.: Graduated non-convexity for robust spatial perception: from non-minimal solvers to global outlier rejection. IEEE Robot. Autom. Lett. (RA-L) 5(2), 1127\u20131134 (2020)","journal-title":"IEEE Robot. Autom. Lett. (RA-L)"},{"key":"1912_CR82","doi-asserted-by":"crossref","unstructured":"Yang, H., Carlone, L.: A polynomial-time solution for robust registration with extreme outlier rates. In: Robotics: Science and Systems (RSS) (2019)","DOI":"10.15607\/RSS.2019.XV.003"},{"key":"1912_CR83","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. 1665\u20131674 (2019)","DOI":"10.1109\/ICCV.2019.00175"},{"key":"1912_CR84","doi-asserted-by":"crossref","unstructured":"Yang, H., Carlone, L.: In perfect shape: certifiably optimal 3d shape reconstruction from 2d landmarks. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 621\u2013630 (2020)","DOI":"10.1109\/CVPR42600.2020.00070"},{"key":"1912_CR85","unstructured":"Yang, H., Carlone, L.: One ring to rule them all: certifiably robust geometric perception with outliers. In: Conference on Neural Information Processing Systems (NeurIPS) (2020)"},{"key":"1912_CR86","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. Robot. 37, 314\u2013333 (2020)","journal-title":"IEEE Trans. Robot."},{"issue":"3","key":"1912_CR87","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(3), 331\u2013366 (2015)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"1912_CR88","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 J. Math. Data Sci. 3(1), 171\u2013200 (2021)","journal-title":"SIAM J. Math. Data Sci."},{"key":"1912_CR89","unstructured":"Zeng, A., Song, S., Nie\u00dfner, M., Fisher, M., Xiao, J., Funkhouser, T.: 3dmatch: learning the matching of local 3d geometry in range scans. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, vol.\u00a01, p.\u00a04 (2017)"},{"issue":"1","key":"1912_CR90","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(1), 351\u2013393 (2021)","journal-title":"Math. Program."},{"issue":"4","key":"1912_CR91","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"XY Zhao","year":"2010","unstructured":"Zhao, X.Y., Sun, D., Toh, K.C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1912_CR92","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(1), 489\u2013532 (2020)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01912-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01912-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01912-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T19:05:30Z","timestamp":1690311930000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01912-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,29]]},"references-count":92,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1912"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01912-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,29]]},"assertion":[{"value":"27 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}