{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T11:45:25Z","timestamp":1772365525112,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,12,16]],"date-time":"2011-12-16T00:00:00Z","timestamp":1323993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s10107-011-0505-8","type":"journal-article","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T10:40:57Z","timestamp":1323945657000},"page":"557-578","source":"Crossref","is-referenced-by-count":23,"title":["The tracial moment problem and trace-optimization of polynomials"],"prefix":"10.1007","volume":"137","author":[{"given":"Sabine","family":"Burgdorf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristijan","family":"Cafuta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Klep","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janez","family":"Povh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,16]]},"reference":[{"key":"505_CR1","unstructured":"Akhiezer, N.I.: The classical moment problem and some related questions in analysis. Translated by N. Kemmer. Hafner Publishing Co., New York (1965)"},{"key":"505_CR2","unstructured":"Burgdorf, S., Klep, I.: The truncated tracial moment problem. J. Oper. Theory (to appear). http:\/\/arxiv.org\/abs\/1001.3679"},{"issue":"11","key":"505_CR3","doi-asserted-by":"crossref","first-page":"2318","DOI":"10.1063\/1.522463","volume":"16","author":"D. Bessis","year":"1975","unstructured":"Bessis D., Moussa P., Villani M.: Monotonic converging variational approximations to the functional integrals in quantum statistical mechanics. J. Math. Phys. 16(11), 2318\u20132325 (1975)","journal-title":"J. Math. Phys."},{"issue":"10","key":"505_CR4","doi-asserted-by":"crossref","first-page":"3035","DOI":"10.1090\/S0002-9939-06-08249-9","volume":"134","author":"C. Bayer","year":"2006","unstructured":"Bayer C., Teichmann J.: The proof of Tchakaloff\u2019s theorem. Proc. Am. Math. Soc. 134(10), 3035\u20133040 (2006)","journal-title":"Proc. Am. Math. Soc."},{"key":"505_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization. MPS\/SIAM Series on Optimization. SIAM, Philadelphia, PA (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"505_CR6","doi-asserted-by":"crossref","unstructured":"Curto, R.E., Fialkow, L.A.: Solution of the truncated complex moment problem for flat data. Mem. Am. Math. Soc. 119(568), x+52 (1996)","DOI":"10.1090\/memo\/0568"},{"issue":"2","key":"505_CR7","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.jmaa.2010.03.045","volume":"369","author":"J. Cimpri\u010d","year":"2010","unstructured":"Cimpri\u010d J.: A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming. J. Math. Anal. Appl. 369(2), 443\u2013452 (2010)","journal-title":"J. Math. Anal. Appl."},{"key":"505_CR8","doi-asserted-by":"crossref","unstructured":"Cafuta, K., Klep, I., Povh, J.: NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials. Optim. Methods Softw. 26(3), 363\u2013380 (2011). http:\/\/ncsostools.fis.unm.si","DOI":"10.1080\/10556788.2010.544312"},{"key":"505_CR9","doi-asserted-by":"crossref","unstructured":"Choi, M.D., Lam, T.Y., Reznick, B.: Sums of squares of real polynomials. In: K-Theory and Algebraic Geometry: Connections with Quadratic Forms and Division Algebras. Proceedings of Symposia in Pure Mathematics, vol. 58, pp. 103\u2013126. AMS, Providence, RI (1995)","DOI":"10.1090\/pspum\/058.2\/1327293"},{"issue":"2","key":"505_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/1971057","volume":"104","author":"A. Connes","year":"1976","unstructured":"Connes A.: Classification of injective factors. Cases II1, II\u221e, III\u03bb, \u03bb\u00a0\u2260 1. Ann. Math. 104(2), 73\u2013115 (1976)","journal-title":"Ann. Math."},{"key":"505_CR11","doi-asserted-by":"crossref","unstructured":"de Oliveira, M.C., Helton, J.W., McCullough, S., Putinar, M.: Engineering systems and free semi-algebraic geometry. In: Emerging Applications of Algebraic Geometry. IMA Volumes in Mathematics and its Applications, vol. 149, pp. 17\u201362. Springer (2008)","DOI":"10.1007\/978-0-387-09686-5_2"},{"key":"505_CR12","doi-asserted-by":"crossref","unstructured":"Doherty, A.C., Liang, Y.-C., Toner, B., Wehner, S.: The quantum moment problem and bounds on entangled multi-prover games. In: Twenty-Third Annual IEEE Conference on Computational Complexity, pp. 199\u2013210. IEEE Computer Society, Los Alamitos, CA (2008)","DOI":"10.1109\/CCC.2008.26"},{"key":"505_CR13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0747-7171(03)00071-3","volume":"37","author":"W. Eberly","year":"2004","unstructured":"Eberly W., Giesbrecht M.: Efficient decomposition of separable algebras. J. Symb. Comput. 37, 35\u201381 (2004)","journal-title":"J. Symb. Comput."},{"key":"505_CR14","first-page":"153","volume":"17","author":"K. Friedl","year":"1985","unstructured":"Friedl K., R\u00f3nyai L.: Polynomial time solutions of some problems in computational algebra. Symp. Theory Comput. Am. Math. Soc. 17, 153\u2013162 (1985)","journal-title":"Symp. Theory Comput. Am. Math. Soc."},{"issue":"6","key":"505_CR15","doi-asserted-by":"crossref","first-page":"2529","DOI":"10.1103\/PhysRev.130.2529","volume":"130","author":"R.J. Glauber","year":"1963","unstructured":"Glauber R.J.: The quantum theory of optical coherence. Phys. Rev. 130(6), 2529\u20132539 (1963)","journal-title":"Phys. Rev."},{"key":"505_CR16","unstructured":"Helton, J.W., de Oliveira, M., Miller, R.L., Stankus, M.: NCAlgebra: a mathematica package for doing non commuting algebra. http:\/\/www.math.ucsd.edu\/~ncalg\/"},{"issue":"2","key":"505_CR17","doi-asserted-by":"crossref","first-page":"675","DOI":"10.2307\/3597203","volume":"156","author":"J.W. Helton","year":"2002","unstructured":"Helton J.W.: \u201cPositive\u201d noncommutative polynomials are sums of squares. Ann. Math. (2) 156(2), 675\u2013694 (2002)","journal-title":"Ann. Math. (2)"},{"key":"505_CR18","doi-asserted-by":"crossref","unstructured":"Henrion, D., Lasserre, J.-B.: Detecting global optimality and extracting solutions in GloptiPoly. In: Positive Polynomials In Control. Lecture Notes in Control and Information Sciences, vol. 312, pp. 293\u2013310. Springer, Berlin (2005)","DOI":"10.1007\/10997703_15"},{"key":"505_CR19","unstructured":"Henrion, D., Lasserre, J.-B., L\u00f6fberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24(4\u20135), 761\u2013779 (2009). http:\/\/www.laas.fr\/~henrion\/software\/gloptipoly3\/"},{"key":"505_CR20","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1016\/j.jpaa.2009.07.003","volume":"214","author":"I. Klep","year":"2010","unstructured":"Klep I., Povh J.: Semidefinite programming and sums of hermitian squares of noncommutative polynomials. J. Pure Appl. Algebra 214, 740\u2013749 (2010)","journal-title":"J. Pure Appl. Algebra"},{"issue":"4","key":"505_CR21","doi-asserted-by":"crossref","first-page":"1816","DOI":"10.1016\/j.aim.2007.09.016","volume":"217","author":"I. Klep","year":"2008","unstructured":"Klep I., Schweighofer M.: Connes\u2019 embedding conjecture and sums of Hermitian squares. Adv. Math. 217(4), 1816\u20131837 (2008)","journal-title":"Adv. Math."},{"issue":"4","key":"505_CR22","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1007\/s10955-008-9632-x","volume":"133","author":"I. Klep","year":"2008","unstructured":"Klep I., Schweighofer M.: Sums of Hermitian squares and the BMV conjecture. J. Stat. Phys. 133(4), 739\u2013760 (2008)","journal-title":"J. Stat. Phys."},{"key":"505_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0406-7","volume-title":"A First Course In Noncommutative Rings. Graduate Texts in Mathematics, vol. 131","author":"T.Y. Lam","year":"1991","unstructured":"Lam T.Y.: A First Course In Noncommutative Rings. Graduate Texts in Mathematics, vol. 131. Springer, New York (1991)"},{"key":"505_CR24","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2000\/01)","DOI":"10.1137\/S1052623400366802"},{"key":"505_CR25","doi-asserted-by":"crossref","DOI":"10.1142\/p665","volume-title":"Moments, Positive Polynomials and Their Applications, vol. 1","author":"J.B. Lasserre","year":"2009","unstructured":"Lasserre J.B.: Moments, Positive Polynomials and Their Applications, vol. 1. Imperial College Press, London (2009)"},{"key":"505_CR26","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Emerging Applications Of Algebraic Geometry. IMA Volumes in Mathematics and its Applications, vol. 149, pp. 157\u2013270. Springer, New York (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"505_CR27","unstructured":"L\u00f6fberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference, Taipei, Taiwan (2004). http:\/\/users.isy.liu.se\/johanl\/yalmip\/"},{"key":"505_CR28","doi-asserted-by":"crossref","unstructured":"Mazziotti, D.A.: Realization of quantum chemistry without wave functions through first-order semidefinite programming. Phys. Rev. Lett. 93(21), 213001, 4 (2004)","DOI":"10.1103\/PhysRevLett.93.213001"},{"issue":"1\u20133","key":"505_CR29","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0024-3795(00)00285-8","volume":"326","author":"S. McCullough","year":"2001","unstructured":"McCullough S.: Factorization of operator-valued polynomials in several non-commuting variables. Linear Algebra Appl. 326(1\u20133), 193\u2013203 (2001)","journal-title":"Linear Algebra Appl."},{"key":"505_CR30","unstructured":"Mittelmann, D.: An independent benchmarking of SDP and SOCP solvers. Math. Program. 95(2, Ser. B), 407\u2013430 (2003). http:\/\/plato.asu.edu\/sub\/pns.html"},{"issue":"1","key":"505_CR31","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s13160-010-0006-9","volume":"27","author":"K. Murota","year":"2010","unstructured":"Murota K., Kanno Y., Kojima M., Kojima S.: A numerical algorithm for block-diagonal decomposition of matrix *-algebras with application to semidefinite programming. Jpn. J. Ind. Appl. Math. 27(1), 125\u2013160 (2010)","journal-title":"Jpn. J. Ind. Appl. Math."},{"issue":"2","key":"505_CR32","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s13160-010-0007-8","volume":"27","author":"T. Maehara","year":"2010","unstructured":"Maehara T., Murota K.: A numerical algorithm for block-diagonal decomposition of matrix *-algebras with general irreducible components. Jpn. J. Ind. Appl. Math. 27(2), 263\u2013293 (2010)","journal-title":"Jpn. J. Ind. Appl. Math."},{"issue":"1","key":"505_CR33","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."},{"key":"505_CR34","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point Polynomial Algorithms In Convex Programming. SIAM Studies in Applied Mathematics, vol. 13","author":"Y. Nesterov","year":"1994","unstructured":"Nesterov Y., Nemirovskii A.: Interior-point Polynomial Algorithms In Convex Programming. SIAM Studies in Applied Mathematics, vol. 13. SIAM, Philadelphia (1994)"},{"issue":"2, Ser. B","key":"505_CR35","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"P.A. Parrilo","year":"2003","unstructured":"Parrilo P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2, Ser. B), 293\u2013320 (2003)","journal-title":"Math. Program."},{"issue":"5","key":"505_CR36","doi-asserted-by":"crossref","first-page":"2157","DOI":"10.1137\/090760155","volume":"20","author":"S. Pironio","year":"2010","unstructured":"Pironio S., Navascues M., Acin A.: Convergent relaxations of polynomial optimization problems with non-commuting variables. SIAM J. Optim. 20(5), 2157\u20132180 (2010)","journal-title":"SIAM J. Optim."},{"key":"505_CR37","unstructured":"Prajna, S., Papachristodoulou, A., Seiler, P., Parrilo, P.A.: SOSTOOLS and its control applications. In: Positive Polynomials in Control. Lecture Notes in Control and Information Sciences, vol. 312, pp. 273\u2013292. Springer, Berlin (2005). http:\/\/www.cds.caltech.edu\/sostools\/"},{"key":"505_CR38","doi-asserted-by":"crossref","unstructured":"Parrilo, P.A., Sturmfels, B.: Minimizing polynomial functions. In: Algorithmic and Quantitative Real Algebraic Geometry (Piscataway, NJ, 2001). DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 60, pp. 83\u201399. American Mathematical Society, Providence, RI (2003)","DOI":"10.1090\/dimacs\/060\/08"},{"key":"505_CR39","doi-asserted-by":"crossref","unstructured":"P\u00e1l, K.F., V\u00e9rtesi, T.: Quantum bounds on Bell inequalities. Phys. Rev. A (3) 79(2), 022120, 12 (2009)","DOI":"10.1103\/PhysRevA.79.022120"},{"issue":"2","key":"505_CR40","first-page":"129","volume":"77","author":"M.V. Ramana","year":"1997","unstructured":"Ramana M.V.: An exact duality theory for semidefinite programming and its complexity implications. Math. Program. Ser. B 77(2), 129\u2013162 (1997)","journal-title":"Math. Program. Ser. B"},{"issue":"3","key":"505_CR41","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1017\/S0017089501030130","volume":"43","author":"J. Stochel","year":"2001","unstructured":"Stochel J.: Solving the truncated moment problem solves the full moment problem. Glasg. Math. J. 43(3), 335\u2013341 (2001)","journal-title":"Glasg. Math. J."},{"key":"505_CR42","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\/12(1\u20134), 625\u2013653 (1999). http:\/\/sedumi.ie.lehigh.edu\/"},{"key":"505_CR43","doi-asserted-by":"crossref","unstructured":"Toh, K.-C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.-H.: SDPT3 a Matlab software package for semidenite programming. Optim. Methods Softw. 11, 545\u2013581 (1999). http:\/\/www.math.nus.edu.sg\/~mattohkc\/sdpt3.html","DOI":"10.1080\/10556789908805762"},{"key":"505_CR44","doi-asserted-by":"crossref","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M., Sugimoto, H.: Algorithm 883: sparsePOP\u2014a sparse semidefinite programming relaxation of polynomial optimization problems. ACM Trans. Math. Softw. 35(2), Art. 15, 13 (2009)","DOI":"10.1145\/1377612.1377619"},{"key":"505_CR45","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of Semidefinite Programming","author":"H. Wolkowicz","year":"2000","unstructured":"Wolkowicz H., Saigal R., Vandenberghe L.: Handbook of Semidefinite Programming. Kluwer, Dordrecht (2000)"},{"key":"505_CR46","doi-asserted-by":"crossref","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). http:\/\/sdpa.sourceforge.net\/","DOI":"10.1080\/1055678031000118482"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0505-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-011-0505-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0505-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T23:48:46Z","timestamp":1561074526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-011-0505-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,16]]},"references-count":46,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["505"],"URL":"https:\/\/doi.org\/10.1007\/s10107-011-0505-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,16]]}}}