{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:28Z","timestamp":1740123988244,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T00:00:00Z","timestamp":1583280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T00:00:00Z","timestamp":1583280000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10957-020-01646-5","type":"journal-article","created":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T09:02:46Z","timestamp":1583312566000},"page":"289-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Semidefinite Program Duals for Separable Polynomial Programs Involving Box Constraints"],"prefix":"10.1007","volume":"185","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0893-5604","authenticated-orcid":false,"given":"Thai Doan","family":"Chuong","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,4]]},"reference":[{"key":"1646_CR1","volume-title":"Nonconvex Optimization and Its Applications","author":"R Horst","year":"1995","unstructured":"Horst, R., Pardalos, M.: Handbook of global optimization. In: Horst, R., Pardalos, P.M. (eds.) Nonconvex Optimization and Its Applications, vol. 3. Kluwer Academic Publishers, Dordrechet (1995)"},{"key":"1646_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01096724","volume":"4","author":"AT Phillips","year":"1994","unstructured":"Phillips, A.T., Rosen, J.B.: A quadratic assignment formulation of the molecular confirmation problem. J. Glob. Optim. 4, 229\u2013241 (1994)","journal-title":"J. Glob. Optim."},{"key":"1646_CR3","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1023\/A:1012752110010","volume":"21","author":"J-B Hiriart-Urruty","year":"2001","unstructured":"Hiriart-Urruty, J.-B.: Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints. J. Glob. Optim. 21, 445\u2013455 (2001)","journal-title":"J. Glob. Optim."},{"key":"1646_CR4","doi-asserted-by":"publisher","DOI":"10.1142\/p665","volume-title":"Moments, Positive Polynomials and Their Applications","author":"J-B Lasserre","year":"2009","unstructured":"Lasserre, J.-B.: Moments, Positive Polynomials and Their Applications. Imperial College Press, London (2009)"},{"key":"1646_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107447226","volume-title":"An Introduction to Polynomial and Semi-algebraic Optimization. Cambridge Texts in Applied Mathematics","author":"J-B Lasserre","year":"2015","unstructured":"Lasserre, J.-B.: An Introduction to Polynomial and Semi-algebraic Optimization. Cambridge Texts in Applied Mathematics. Cambridge University Press, Cambridge (2015)"},{"key":"1646_CR6","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1007\/s10898-012-9917-0","volume":"56","author":"H Tuy","year":"2013","unstructured":"Tuy, H., Tuan, H.D.: Generalized S-Lemma and strong duality in nonconvex quadratic programming. J. Glob. Optim. 56, 1045\u20131072 (2013)","journal-title":"J. Glob. Optim."},{"key":"1646_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1137\/S1052623498336930","volume":"11","author":"A Beck","year":"2000","unstructured":"Beck, A., Teboulle, M.: Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J. Optim. 11, 179\u2013188 (2000)","journal-title":"SIAM J. Optim."},{"key":"1646_CR8","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1023\/B:JOTA.0000042530.24671.80","volume":"122","author":"MC Pinar","year":"2004","unstructured":"Pinar, M.C.: Sufficient global optimality conditions for bivalent quadratic optimization. J. Optim. Theory Appl. 122, 433\u2013440 (2004)","journal-title":"J. Optim. Theory Appl."},{"key":"1646_CR9","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s10107-006-0012-5","volume":"110","author":"V Jeyakumar","year":"2007","unstructured":"Jeyakumar, V., Rubinov, A.M., Wu, Z.Y.: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions. Math. Program. 110, 521\u2013541 (2007)","journal-title":"Math. Program."},{"key":"1646_CR10","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10107-004-0549-0","volume":"102","author":"D Vandenbussche","year":"2005","unstructured":"Vandenbussche, D., Nemhauser, G.L.: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102, 531\u2013557 (2005)","journal-title":"Math. Program."},{"key":"1646_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10898-013-0058-x","volume":"58","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Li, G., Srisatkunarajah, S.: Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations. J. Glob. Optim. 58, 31\u201350 (2014)","journal-title":"J. Glob. Optim."},{"key":"1646_CR12","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1137\/S1052623401399903","volume":"15","author":"D Bertsimas","year":"2005","unstructured":"Bertsimas, D., Popescu, I.: Optimal inequalities in probability theory: a convex optimization approach. SIAM J. Optim. 15, 780\u2013804 (2005)","journal-title":"SIAM J. Optim."},{"key":"1646_CR13","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s11081-008-9076-9","volume":"10","author":"V Jeyakumar","year":"2009","unstructured":"Jeyakumar, V., Huy, N.Q., Li, G.: Necessary and sufficient conditions for S-lemma and nonconvex quadratic optimization. Optim. Eng. 10, 491\u2013503 (2009)","journal-title":"Optim. Eng."},{"key":"1646_CR14","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.orl.2019.09.013","volume":"47","author":"NH Chieu","year":"2019","unstructured":"Chieu, N.H., Chuong, T.D., Jeyakumar, V., Li, G.: A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints. Oper. Res. Lett. 47, 530\u2013536 (2019)","journal-title":"Oper. Res. Lett."},{"key":"1646_CR15","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.ejor.2019.08.009","volume":"280","author":"NH Chieu","year":"2020","unstructured":"Chieu, N.H., Jeyakumar, V., Li, G.: Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality. Eur. J. Oper. Res. 280, 441\u2013452 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"1646_CR16","volume-title":"An Easy Path to Convex Analysis and Applications. Synthesis Lectures on Mathematics and Statistics","author":"BS Mordukhovich","year":"2014","unstructured":"Mordukhovich, B.S., Nam, N.M.: An Easy Path to Convex Analysis and Applications. Synthesis Lectures on Mathematics and Statistics, vol. 14. Morgan & Claypool Publishers, Williston (2014)"},{"key":"1646_CR17","unstructured":"Parrilo, P.A.: Polynomial optimization, sums of squares, and applications. In: Semidefinite Optimization and Convex Algebraic Geometry. MOS-SIAM Ser. Optim., vol. 13, pp. 251\u2013291. SIAM, Philadelphia (2013)"},{"key":"1646_CR18","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming. Version 2.1 (2014). http:\/\/cvxr.com\/cvx"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01646-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-020-01646-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01646-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T00:54:33Z","timestamp":1614819273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-020-01646-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,4]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["1646"],"URL":"https:\/\/doi.org\/10.1007\/s10957-020-01646-5","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2020,3,4]]},"assertion":[{"value":"22 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}