{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:17Z","timestamp":1740122417468,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T00:00:00Z","timestamp":1646784000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T00:00:00Z","timestamp":1646784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10898-022-01148-w","type":"journal-article","created":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T02:02:28Z","timestamp":1646791348000},"page":"415-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space"],"prefix":"10.1007","volume":"84","author":[{"given":"Meng-Meng","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2269-961X","authenticated-orcid":false,"given":"Zheng-Hai","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng-Long","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,9]]},"reference":[{"issue":"2","key":"1148_CR1","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10589-007-9131-z","volume":"43","author":"J Nie","year":"2009","unstructured":"Nie, J.: Sum of squares method for sensor network localization. Comput. Optim. Appl. 43(2), 151\u2013179 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1148_CR2","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":"1148_CR3","doi-asserted-by":"crossref","unstructured":"Barmpoutis, A., Jian, B., Vemuri, B. C., Shepherd, T.M.: Symmetric positive 4th order tensors and their estimation from diffusion weighted MRI. In: Proceedings of the 20th International Conference on Information Processing in Medical Imaging, Springer Berlin Heidelberg, 308-319 (2007)","DOI":"10.1007\/978-3-540-73273-0_26"},{"key":"1148_CR4","doi-asserted-by":"crossref","unstructured":"Feng, C., Lagoa, C.M., Sznaier, M.: Hybrid system identification via sparse polynomial optimization. American Control Conference (ACC), IEEE (2010)","DOI":"10.1109\/CDC.2010.5718082"},{"key":"1148_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3984-4","volume-title":"Approximation Methods for Polynomial Optimization","author":"ZN Li","year":"2012","unstructured":"Li, Z.N., He, S.M., Zhang, S.Z.: Approximation Methods for Polynomial Optimization. Springer, New york (2012)"},{"key":"1148_CR6","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: Moments. Imperial College Press, Positive Polynomials and Their Applications (2009)","DOI":"10.1142\/p665"},{"key":"1148_CR7","volume-title":"Handbook on Semidefinite. Conic and Polynomial Optimization","author":"JB Lasserre","year":"2012","unstructured":"Lasserre, J.B.: Handbook on Semidefinite. Conic and Polynomial Optimization. Springer, United States (2012)"},{"key":"1148_CR8","first-page":"102","volume":"5","author":"NZ Shor","year":"1987","unstructured":"Shor, N.Z.: An approach to obtaining global extremums in polynomial mathematical programming problems. Kibernetika 5, 102\u2013106 (1987)","journal-title":"Kibernetika"},{"key":"1148_CR9","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-1-4757-3216-0_17","volume-title":"High Performance Optimization","author":"YE Nesterov","year":"2000","unstructured":"Nesterov, Y.E.: Squared functional systems and optimization problems. In: Frenk, J.B.G., Roos, C., Terlaky, T., Zhang, S. (eds.) High Performance Optimization, pp. 405\u2013440. Kluwer Academic Publishers, Netherlands (2000)"},{"key":"1148_CR10","volume-title":"Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization","author":"PA Parrilo","year":"2000","unstructured":"Parrilo, P.A.: Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization. California Institute of Technology, Pasadena (2000).. (Ph.D. Dissertation)"},{"key":"1148_CR11","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."},{"key":"1148_CR12","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, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"1148_CR13","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, The IMA Volumes in Mathematics and Its Applications, 149, 1-114 (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"1148_CR14","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1007\/s10208-014-9225-9","volume":"14","author":"J Nie","year":"2014","unstructured":"Nie, J.: The $${\\cal{A}}$$-truncated $$K$$-moment problem. Found. Comput. Math. 14, 1243\u20131276 (2014)","journal-title":"Found. Comput. Math."},{"key":"1148_CR15","doi-asserted-by":"crossref","unstructured":"Henrion, D., Lasserre, J.: Detecting global optimality and extracting solutions in GloptiPoly. In: Henrion, D., Garulli, A. (Eds), Positive polynomials in control, Lecture Notes on Control and Information Sciences, 312, 293-310, Springer, Berlin, (2005)","DOI":"10.1007\/10997703_15"},{"key":"1148_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Time Methods in Convex Programming","author":"Y Nestrov","year":"1994","unstructured":"Nestrov, Y., Nemirovski, A.: Interior Point Polynomial Time Methods in Convex Programming. SIAM, Philadelphia (1994)"},{"issue":"1","key":"1148_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1080\/10556788.2019.1576176","volume":"35","author":"DF Sun","year":"2020","unstructured":"Sun, D.F., Toh, K.C., Yuan, Y.C., Zhao, X.Y.: SDPNAL$$+$$: a Matlab software for semidefinite programming with bound constraints (version 1.0). Optim. Method. Softw. 35(1), 87\u2013115 (2020)","journal-title":"Optim. Method. Softw."},{"key":"1148_CR18","first-page":"408","volume":"22","author":"J Nie","year":"2012","unstructured":"Nie, J., Wang, L.: Regularization methods for SDP relaxations in large-scale polynomial optimization. SIAM J. Matrix Anal. Appl. 22, 408\u2013428 (2012)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1148_CR19","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim. Method. Softw. 11, 625\u2013653 (1999)","journal-title":"Optim. Method. Softw."},{"key":"1148_CR20","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., Tutuncu, R.H.: SDPT3-a Matlab software package for semidefinite programming. Optim. Method. Softw. 11, 545\u2013581 (1999)","journal-title":"Optim. Method. Softw."},{"issue":"3","key":"1148_CR21","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1137\/05064504X","volume":"17","author":"JB Lasserre","year":"2006","unstructured":"Lasserre, J.B.: Convergent SDP-relaxations in polynomial optimization with sparsity. SIAM J. Optim. 17(3), 822\u2013843 (2006)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1148_CR22","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":"2","key":"1148_CR23","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/18M118935X","volume":"3","author":"AA Ahmadi","year":"2019","unstructured":"Ahmadi, A.A., Majumdar, A.: DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization. SIAM J. Appl. Algebra Geom. 3(2), 193\u2013230 (2019)","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"1","key":"1148_CR24","doi-asserted-by":"publisher","first-page":"e2125","DOI":"10.1002\/nla.2125","volume":"25","author":"HB Chen","year":"2018","unstructured":"Chen, H.B., Chen, Y.N., Li, G.Y., Qi, L.Q.: A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test. Numer. Linear Algebra Appl. 25(1), e2125 (2018)","journal-title":"Numer. Linear Algebra Appl."},{"key":"1148_CR25","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s13675-015-0050-y","volume":"5","author":"JB Lasserre","year":"2017","unstructured":"Lasserre, J.B., Toh, K.C., Yang, S.: A bounded degree SOS hierarchy for polynomial optimization. EURO J. Comput. Optim. 5, 87\u2013117 (2017)","journal-title":"EURO J. Comput. Optim."},{"issue":"4","key":"1148_CR26","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s10898-019-00831-9","volume":"75","author":"TD Chuong","year":"2019","unstructured":"Chuong, T.D., Jeyakumar, V., Li, G.: A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs. J. Global Optim. 75(4), 885\u2013919 (2019)","journal-title":"J. Global Optim."},{"key":"1148_CR27","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10589-020-00231-w","volume":"78","author":"MM 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."},{"key":"1148_CR28","volume-title":"Circulant Matrices","author":"PJ Davis","year":"1979","unstructured":"Davis, P.J.: Circulant Matrices. Wiley-Interscience, New York (1979)"},{"key":"1148_CR29","unstructured":"Kilmer, M. E., Martin, C. D., Perrone, L.: A third-order generalization of the matrix SVD as a product of third-order tensors. Tech. Rep. TR-2008-4, Tufts University, Department of Computer Science, October (2008)"},{"key":"1148_CR30","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"ME Kilmer","year":"2011","unstructured":"Kilmer, M.E., Martin, C.D.: Factorization strategies for third-order tensors. Linear Algebra Appl. 435, 641\u2013658 (2011)","journal-title":"Linear Algebra Appl."},{"key":"1148_CR31","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, 148\u2013172 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1148_CR32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovskii, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. SIAM, Philadelphia (2001)"},{"key":"1148_CR33","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. Johns Hopkins University Press, Baltimore (2013)","edition":"4"},{"issue":"3","key":"1148_CR34","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1561\/0100000006","volume":"2","author":"RM Gray","year":"2005","unstructured":"Gray, R.M.: Toeplitz and circulant matrices: a review. Found. Trend. Commun. Inform. Theory 2(3), 155\u2013239 (2005)","journal-title":"Found. Trend. Commun. Inform. Theory"},{"key":"1148_CR35","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00707-010-0382-x","volume":"217","author":"A Kaveh","year":"2011","unstructured":"Kaveh, A., Rahami, H.: Block circulant matrices and applications in free vibration analysis of cyclically repetitive structures. Acta Mech. 217, 51\u201362 (2011)","journal-title":"Acta Mech."},{"issue":"13","key":"1148_CR36","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1049\/iet-com.2013.0030","volume":"7","author":"JM Sun","year":"2013","unstructured":"Sun, J.M., Wang, S., Dong, Y.: Sparse block circulant matrices for compressed sensing. IET Commun. 7(13), 1412\u20131418 (2013)","journal-title":"IET Commun."},{"key":"1148_CR37","doi-asserted-by":"crossref","unstructured":"Liao, S. Y., Li, Z., Lin, X., Qiu, Q. R., Wang, Y. Z., Yuan, B.: Energy-efficient, high-performance, highly-compressed deep neural network design using block-circulant matrices. In Proceedings of the 2017 IEEE\/ACM International Conference on Computer-Aided Design, IEEE Press, (2017)","DOI":"10.1109\/ICCAD.2017.8203813"},{"key":"1148_CR38","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0024-3795(93)00167-X","volume":"218","author":"D Chillag","year":"1995","unstructured":"Chillag, D.: Regular representations of semisimple algebras. separable field extensions, group characters, generalized circulants, and generalized cyclic codes. Linear Algebra Appl. 218, 147\u2013183 (1995)","journal-title":"Linear Algebra Appl."},{"key":"1148_CR39","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1109\/34.192463","volume":"11","author":"SG Mallat","year":"1989","unstructured":"Mallat, S.G.: A Theory for multi-resolution signal decomposition: the wavelet representation. IEEE T. Pattern Anal. 11, 674\u2013691 (1989)","journal-title":"IEEE T. Pattern Anal."},{"issue":"224","key":"1148_CR40","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0024-3795(94)00298-R","volume":"223","author":"J Kautsky","year":"1995","unstructured":"Kautsky, J., Turcajov\u00e1, R.: Discrete biorthogonal wavelet transforms as block circulant matrices. Linear Algebra Appl. 223(224), 393\u2013413 (1995)","journal-title":"Linear Algebra Appl."},{"key":"1148_CR41","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0019-9958(65)90300-1","volume":"8","author":"SW Golomb","year":"1965","unstructured":"Golomb, S.W., Gordon, B.: Codes with bounded synchronisation delay. Inform. Control 8, 355\u2013372 (1965)","journal-title":"Inform. Control"},{"key":"1148_CR42","doi-asserted-by":"crossref","unstructured":"Arqu\u00e8s, D., Michel, C.: A possible code in the genetic code. In: E. W. Mayr and C. Puech (Eds.) \u201cSTACS95,\u201d no. 900 in LNCS, , SpringerVerlag, Berlin\/Heidelberg\/New York, 640-651, (1995)","DOI":"10.1007\/3-540-59042-0_112"},{"key":"1148_CR43","doi-asserted-by":"crossref","unstructured":"Berg, C.: The multidimensional moment problem and semi-groups, in Moments in Mathematics. H.J. Landau, ed., AMS, Providence, RI, 110-124, (1980)","DOI":"10.1090\/psapm\/037\/921086"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01148-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01148-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01148-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T17:25:55Z","timestamp":1674926755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01148-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,9]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["1148"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01148-w","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2022,3,9]]},"assertion":[{"value":"14 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}