{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:04:05Z","timestamp":1760061845879},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T00:00:00Z","timestamp":1378944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s10589-013-9596-x","type":"journal-article","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T11:41:38Z","timestamp":1378899698000},"page":"387-402","source":"Crossref","is-referenced-by-count":4,"title":["Lower bounds on the global minimum of a polynomial"],"prefix":"10.1007","volume":"57","author":[{"given":"M.","family":"Ghasemi","sequence":"first","affiliation":[]},{"given":"J. B.","family":"Lasserre","sequence":"additional","affiliation":[]},{"given":"M.","family":"Marshall","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,12]]},"reference":[{"issue":"2","key":"9596_CR1","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1137\/110836869","volume":"22","author":"M. Ghasemi","year":"2012","unstructured":"Ghasemi, M., Marshall, M.: Lower bounds for polynomials using geometric programming. SIAM J. Optim. 22(2), 460\u2013473 (2012)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9596_CR2","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J.B. 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":"9596_CR3","series-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci.","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1090\/dimacs\/060\/08","volume-title":"Algorithmic and Quantitative Real Algebraic Geometry","author":"P. Parrilo","year":"2003","unstructured":"Parrilo, P., Sturmfels, B.: Minimizing polynomial functions. In: Algorithmic and Quantitative Real Algebraic Geometry. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 60, pp. 83\u201399. Amer. Math. Soc., Providence (2003)"},{"issue":"3","key":"9596_CR4","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10107-005-0672-6","volume":"106","author":"J. Nie","year":"2006","unstructured":"Nie, J., Demmel, J., Sturmfels, B.: Minimizing polynomials via sum of squares over the gradient ideal. Math. Program. 106(3), 587\u2013606 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"9596_CR5","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(1), 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9596_CR6","doi-asserted-by":"crossref","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."},{"key":"9596_CR7","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, 336\u2013356 (2009)","journal-title":"SIAM J. Optim."},{"key":"9596_CR8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s00607-006-0182-2","volume":"78","author":"J. Povh","year":"2006","unstructured":"Povh, J., Rendl, F., Wiegele, A.: A boundary point method to solve semidefinite programs. Computing 78, 277\u2013286 (2006)","journal-title":"Computing"},{"key":"9596_CR9","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X.Y. Zhao","year":"2010","unstructured":"Zhao, X.Y., Sun, D.F., Toh, K.C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20, 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."},{"key":"9596_CR10","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/s00013-007-2251-y","volume":"89","author":"J.B. Lasserre","year":"2007","unstructured":"Lasserre, J.B.: Sufficient conditions for a real polynomial to be a sum of squares. Arch. Math. (Basel) 89, 390\u2013398 (2007)","journal-title":"Arch. Math. (Basel)"},{"key":"9596_CR11","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s00209-010-0753-y","volume":"269","author":"C. Fidalgo","year":"2010","unstructured":"Fidalgo, C., Kovacek, A.: Positive semidefinite diagonal minus tail forms are sums of squares. Math. Z. 269, 629\u2013645 (2010)","journal-title":"Math. Z."},{"key":"9596_CR12","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s00013-010-0179-0","volume":"95","author":"M. Ghasemi","year":"2010","unstructured":"Ghasemi, M., Marshall, M.: Lower bounds for a polynomial in terms of its coefficients. Arch. Math. (Basel) 95, 343\u2013353 (2010)","journal-title":"Arch. Math. (Basel)"},{"key":"9596_CR13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s11081-007-9001-7","volume":"8","author":"S. Boyd","year":"2007","unstructured":"Boyd, S., Kim, S.-J., Vandenberghe, L., Hassibi, A.: A tutorial on geometric programming. Optim. Eng. 8, 67\u2013127 (2007)","journal-title":"Optim. Eng."},{"key":"9596_CR14","unstructured":"Stein, W.A., et\u00a0al.: Sage Mathematics Software (Version\u00a05.7). The Sage Development Team (2013). http:\/\/www.sagemath.org"},{"key":"9596_CR15","unstructured":"Zhao, X.Y., Sun, D.F., Toh, K.C.: SDPNAL Version 0.1: A MATLAB software for semidefinite programming based on a semi-smooth Newton-CG augmented Lagrangian method. http:\/\/www.math.nus.edu.sg\/~mattohkc\/SDPNAL.html"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9596-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9596-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9596-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T19:55:03Z","timestamp":1563911703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9596-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,12]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["9596"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9596-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,12]]}}}