{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:54:34Z","timestamp":1720698874565},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,8,31]],"date-time":"2006-08-31T00:00:00Z","timestamp":1156982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,8,31]],"date-time":"2006-08-31T00:00:00Z","timestamp":1156982400000},"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":["Optimization Letters"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s11590-006-0025-2","type":"journal-article","created":{"date-parts":[[2006,8,30]],"date-time":"2006-08-30T09:08:47Z","timestamp":1156928927000},"page":"245-258","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On a decomposition method for nonconvex global optimization"],"prefix":"10.1007","volume":"1","author":[{"given":"Hoang","family":"Tuy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,8,31]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01582066","volume":"63","author":"A. Ben-Tal","year":"1994","unstructured":"Ben-Tal A., et\u00a0al. (1994) Global minimization by reducing the duality gap. Math. Program. 63, 193\u2013212","journal-title":"Math. Program."},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s101070100236","volume":"91","author":"M. D\u00fcr","year":"2001","unstructured":"D\u00fcr M. (2001) Dual bounding procedures lead to convergent branch and bound algorithms. Math. Program. Ser. A 91, 117\u2013125","journal-title":"Math. Program. Ser. A"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1023\/A:1022687222060","volume":"95","author":"M. D\u00fcr","year":"2002","unstructured":"D\u00fcr M., Horst R. (2002) Lagrange duality and partitioning techniques in nonconvex global optimization. J. Optim. Theory Appl. 95, 347\u2013369","journal-title":"J. Optim. Theory Appl."},{"key":"25_CR4","unstructured":"Ekeland I., Temam R. (1976) Convex analysis and variational problems. North-Holland, Amsterdam, American Elsevier, New York"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/0-387-25570-2_3","volume-title":"Essays and Surveys in Global Optimization","author":"R. Horst","year":"2005","unstructured":"Horst R., Thoai N.V. (2005) Duality bound methods in global optimization. In: Audet C., Hansen P., Savard G. (eds) Essays and Surveys in Global Optimization. Springer, Berlin Heidelberg New York, pp. 79\u2013105"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1023\/A:1026437621223","volume":"107","author":"N.V. Thoai","year":"2000","unstructured":"Thoai N.V. (2000) Duality bound method for the general quadratic programming problem with quadratic constraints. J. Optim. Theory Appl. 107, 331\u2013354","journal-title":"J. Optim. Theory Appl."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/A:1013871532570","volume":"22","author":"N.V. Thoai","year":"2002","unstructured":"Thoai N.V. (2002) Convergence of duality bound method in partly convex programming. J. Global Optim. 22, 263\u2013270","journal-title":"J. Global Optim."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1014865432210","volume":"113","author":"N.V. Thoai","year":"2002","unstructured":"Thoai N.V. (2002) Convergence and application of a decomposition method using duality bounds for nonconvex global optimization. J. Optim. Theory Appl. 113, 165\u2013193","journal-title":"J. Optim. Theory Appl."},{"key":"25_CR9","first-page":"217","volume":"29","author":"H. Tuy","year":"2004","unstructured":"Tuy H. (2004) Minimax theorems revisited. Acta Math. Vietnamica 29, 217\u2013229","journal-title":"Acta Math. Vietnamica"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Tuy, H.: Convex Analysis and Global Optimization. Kluwer (1998)","DOI":"10.1007\/978-1-4757-2809-5"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10898-004-1947-9","volume":"32","author":"H. Tuy","year":"2005","unstructured":"Tuy H. (2005) On solving nonconvex global optimization by reducing the duality gap. J. Global Optim. 32, 349\u2013365","journal-title":"J. Global Optim."},{"key":"25_CR12","unstructured":"Tuy, H.: A parametric minimax theorem with applications. Submitted"},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/S1052623499359828","volume":"11","author":"H. Tuy","year":"2000","unstructured":"Tuy H. (2000) Monotonic optimization: problems and solution methods. SIAM J. Optim. 11(2): 464\u2013494","journal-title":"SIAM J. Optim."},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/0-387-25570-2_2","volume-title":"Essays and Surveys in Global Optimization","author":"H. Tuy","year":"2005","unstructured":"Tuy H., Al-Khayyal F., Thach P.T. (2005) Monotonic optimization: branch and cut methods. In: Audet C., Hansen P., Savard G. (eds) Essays and Surveys in Global Optimization. Springer, Berlin Heidelberg New York, pp. 39\u201378"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0025-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-006-0025-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0025-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0025-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T17:57:51Z","timestamp":1652810271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-006-0025-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,31]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["25"],"URL":"https:\/\/doi.org\/10.1007\/s11590-006-0025-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,31]]},"assertion":[{"value":"12 June 2006","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2006","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}