{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:07Z","timestamp":1740122647163,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T00:00:00Z","timestamp":1717286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T00:00:00Z","timestamp":1717286400000},"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"}]},{"name":"JSPS KAKENHI","award":["Grant Number 21K11767"],"award-info":[{"award-number":["Grant Number 21K11767"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10589-024-00582-8","type":"journal-article","created":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T12:01:37Z","timestamp":1717329697000},"page":"183-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization"],"prefix":"10.1007","volume":"89","author":[{"given":"Hiroki","family":"Marumo","sequence":"first","affiliation":[]},{"given":"Sunyoung","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Makoto","family":"Yamashita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,2]]},"reference":[{"key":"582_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadi, A.A., Majumdar, A.: DSOS and SDSOS optimization: LP and SOCP-based alternatives to sum of squares optimization. In: 2014 48th Annual conference on information sciences and systems (CISS), pp. 1\u20135. IEEE (2014)","DOI":"10.1109\/CISS.2014.6814141"},{"issue":"11","key":"582_CR2","doi-asserted-by":"publisher","first-page":"3775","DOI":"10.1007\/s00371-021-02220-4","volume":"38","author":"M Du","year":"2022","unstructured":"Du, M., Luo, T., Xu, H., Song, Y., Wang, C.: Robust HDR video watermarking method based on saliency extraction and T-SVD. Vis. Comput. 38(11), 3775\u20133789 (2022)","journal-title":"Vis. Comput."},{"key":"582_CR3","volume-title":"A Collection of Test Problems for Constrained Global Optimization Algorithms. Lecture Notes in Computer Science","author":"C Floudas","year":"1990","unstructured":"Floudas, C., Pardalos, P.: A Collection of Test Problems for Constrained Global Optimization Algorithms. Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg (1990)"},{"issue":"2","key":"582_CR4","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)","journal-title":"IFAC-PapersOnLine"},{"key":"582_CR5","unstructured":"Ghosh, A., Tsigaridas, E.P., Descoteaux, M., Comon, P., Mourrain, B., Deriche, R.: A polynomial based approach to extract the maxima of an antipodally symmetric spherical function and its application to extract fiber directions from the orientation distribution function in diffusion MRI. In: 11th International conference on medical image computing and computer assisted intervention (MICCAI), pp. 237 (2008)"},{"key":"582_CR6","volume-title":"Multiple View Geometry in Computer Vision","author":"R Hartley","year":"2003","unstructured":"Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2003)"},{"issue":"1","key":"582_CR7","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1137\/110837711","volume":"34","author":"ME Kilmer","year":"2013","unstructured":"Kilmer, M.E., Braman, K., Hao, N., Hoover, R.C.: Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging. SIAM J. Matrix Anal. Appl. 34(1), 148\u2013172 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"582_CR8","unstructured":"Kilmer, M.E., Martin,C.D., Perrone, L.: A third-order generalization of the matrix SVD as a product of third-order tensors. Tufts University, Department of Computer Science, Tech. Rep. TR-2008-4 (2008)"},{"issue":"3","key":"582_CR9","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":"3","key":"582_CR10","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."},{"issue":"3","key":"582_CR11","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TSP.2002.808112","volume":"51","author":"B Mariere","year":"2003","unstructured":"Mariere, B., Luo, Z.-Q., Davidson, T.N.: Blind constant modulus equalization via convex optimization. IEEE Trans. Signal Process. 51(3), 805\u2013818 (2003)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"582_CR12","doi-asserted-by":"publisher","first-page":"A474","DOI":"10.1137\/110841229","volume":"35","author":"CD Martin","year":"2013","unstructured":"Martin, C.D., Shafer, R., LaRue, B.: An order-p tensor factorization with applications in imaging. SIAM J. Sci. Comput. 35(1), A474\u2013A490 (2013)","journal-title":"SIAM J. Sci. Comput."},{"key":"582_CR13","unstructured":"Meeraus. , A.: Globallib. https:\/\/github.com\/GAMS-dev\/gamsworld\/tree\/master\/GlobalLib"},{"key":"582_CR14","unstructured":"Mosek. Mosek Modeling Cookbook (2020). https:\/\/docs.mosek.com\/modeling-cookbook\/index.html"},{"key":"582_CR15","unstructured":"Mosek. Mosek Optimizer API for Julia 10.1.31 (2023). https:\/\/docs.mosek.com\/10.1\/juliaapi\/index.html"},{"key":"582_CR16","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-point polynomial algorithms in convex programming. Society for Industrial and Applied Mathematics (1994)","DOI":"10.1137\/1.9781611970791"},{"issue":"2","key":"582_CR17","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1137\/110825844","volume":"22","author":"J Nie","year":"2012","unstructured":"Nie, J., Wang, L.: Regularization methods for SDP relaxations in large-scale polynomial optimization. SIAM J. Optim. 22(2), 408\u2013428 (2012)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"582_CR18","doi-asserted-by":"publisher","first-page":"2299","DOI":"10.1109\/TSP.2009.2016885","volume":"57","author":"D Nion","year":"2009","unstructured":"Nion, D., Sidiropoulos, N.D.: Adaptive algorithms to track the PARAFAC decomposition of a third-order tensor. IEEE Trans. Signal Process. 57(6), 2299\u20132310 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"582_CR19","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, 293\u2013320 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"582_CR20","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putinar","year":"1993","unstructured":"Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42(3), 969\u2013984 (1993)","journal-title":"Indiana Univ. Math. J."},{"key":"582_CR21","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1023\/A:1024778309049","volume":"26","author":"L Qi","year":"2003","unstructured":"Qi, L., LayTeo, K.: Multivariate polynomial minimization and its application in signal processing. J. Glob. Optim. 26, 419\u2013433 (2003)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"582_CR22","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1137\/22M1515689","volume":"34","author":"Z Qu","year":"2024","unstructured":"Qu, Z., Tang, X.: Correlatively sparse Lagrange multiplier expression relaxation for polynomial optimization. SIAM J. Optim. 34(1), 127\u2013162 (2024)","journal-title":"SIAM J. Optim."},{"key":"582_CR23","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1090\/conm\/253\/03936","volume":"253","author":"B Reznick","year":"2000","unstructured":"Reznick, B.: Some concrete aspects of Hilbert\u2019s 17th problem. Contemp. Math. 253, 251\u2013272 (2000)","journal-title":"Contemp. Math."},{"issue":"4","key":"582_CR24","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1109\/TIP.2014.2305840","volume":"23","author":"O Semerci","year":"2014","unstructured":"Semerci, O., Hao, N., Kilmer, M.E., Miller, E.L.: Tensor-based formulation and nuclear norm regularization for multienergy computed tomography. IEEE Trans. Image Process. 23(4), 1678\u20131693 (2014)","journal-title":"IEEE Trans. Image Process."},{"issue":"6","key":"582_CR25","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1016\/j.ijplas.2007.07.016","volume":"24","author":"S Soare","year":"2008","unstructured":"Soare, S., Yoon, J.W., Cazacu, O.: On the use of homogeneous polynomials to develop anisotropic yield functions with applications to sheet forming. Int. J. Plast. 24(6), 915\u2013944 (2008)","journal-title":"Int. J. Plast."},{"issue":"1","key":"582_CR26","doi-asserted-by":"publisher","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(1), 87\u2013115 (2020)","journal-title":"Optim. Methods Softw."},{"key":"582_CR27","unstructured":"Tao, D., Maybank,S., Hu,W., Li, X.: Stable third-order tensor representation for colour image classification. In: The 2005 IEEE\/WIC\/ACM International Conference on Web Intelligence (WI\u201905), pp. 641\u2013644. IEEE (2005)"},{"issue":"1","key":"582_CR28","doi-asserted-by":"publisher","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 program relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17(1), 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"key":"582_CR29","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, 30\u201358 (2021)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"582_CR30","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1080\/1055678031000118482","volume":"18","author":"M Yamashita","year":"2003","unstructured":"Yamashita, M., Fujisawa, K., Kojima, M.: Implementation and evaluation of SDPA 6.0 (semidefinite programming algorithm 6.0). Optim. Methods Softw. 18(4), 491\u2013505 (2003)","journal-title":"Optim. Methods Softw."},{"issue":"8","key":"582_CR31","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1016\/S0167-8191(03)00087-5","volume":"29","author":"M Yamashita","year":"2003","unstructured":"Yamashita, M., Fujisawa, K., Kojima, M.: SDPARA: semidefinite programming algorithm parallel version. Parallel Comput. 29(8), 1053\u20131067 (2003)","journal-title":"Parallel Comput."},{"key":"582_CR32","unstructured":"Zhang, S., Wang, K., Chen, B., Huang, X.: A new framework for co-clustering of gene expression data. In: Pattern Recognition in Bioinformatics: 6th IAPR International Conference, PRIB 2011, Delft, The Netherlands, November 2-4, 2011, Proceedings 6, pp. 1\u201312. Springer (2011)"},{"issue":"2","key":"582_CR33","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10898-022-01148-w","volume":"84","author":"M-M Zheng","year":"2022","unstructured":"Zheng, M.-M., Huang, Z.-H., Hu, S.-L.: Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space. J. Glob. Optim. 84(2), 415\u2013440 (2022)","journal-title":"J. Glob. Optim."},{"key":"582_CR34","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10589-020-00231-w","volume":"78","author":"M-M Zheng","year":"2021","unstructured":"Zheng, M.-M., Huang, Z.-H., Wang, Y.: T-positive semidefiniteness of third-order symmetric tensors and t-semidefinite programming. Comput. Optim. Appl. 78, 239\u2013272 (2021)","journal-title":"Comput. Optim. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00582-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00582-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00582-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T08:12:34Z","timestamp":1722845554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00582-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,2]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["582"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00582-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2024,6,2]]},"assertion":[{"value":"13 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors have no Conflict of interest to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}