{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T10:29:47Z","timestamp":1750156187402},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T00:00:00Z","timestamp":1299628800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s11590-011-0300-8","type":"journal-article","created":{"date-parts":[[2011,3,8]],"date-time":"2011-03-08T10:53:05Z","timestamp":1299581585000},"page":"363-373","source":"Crossref","is-referenced-by-count":13,"title":["Solution existence and stability of quadratically constrained convex quadratic programs"],"prefix":"10.1007","volume":"6","author":[{"given":"D. S.","family":"Kim","sequence":"first","affiliation":[]},{"given":"N. N.","family":"Tam","sequence":"additional","affiliation":[]},{"given":"N. D.","family":"Yen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,9]]},"reference":[{"key":"300_CR1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"K.M. Anstreicher","year":"2009","unstructured":"Anstreicher K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43, 471\u2013484 (2009)","journal-title":"J. Glob. Optim."},{"key":"300_CR2","volume-title":"Introduction to Convex Analysis and Integer Programming","author":"E.G. Belousov","year":"1977","unstructured":"Belousov E.G.: Introduction to Convex Analysis and Integer Programming. Moscow University Publ., Moscow (1977) (in Russian)"},{"key":"300_CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/A:1014813701864","volume":"22","author":"E.G. Belousov","year":"2002","unstructured":"Belousov E.G., Klatte D.: A Frank\u2013Wolfe type theorem for convex polynomial programs. Comput. Optim. Appl. 22, 37\u201348 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"300_CR4","volume-title":"Nonlinear Programming","author":"D.P. Bertsekas","year":"2003","unstructured":"Bertsekas D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (2003)","edition":"2"},{"key":"300_CR5","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s10957-009-9563-y","volume":"143","author":"Z. Dost\u00e1l","year":"2009","unstructured":"Dost\u00e1l Z.: On solvability of convex noncoercive quadratic programming problems. J. Optim. Theory Appl. 143, 413\u2013416 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"300_CR6","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1287\/mnsc.17.11.698","volume":"17","author":"B.C. Eaves","year":"1971","unstructured":"Eaves B.C.: On quadratic programming. Manag. Sci. 17, 698\u2013711 (1971)","journal-title":"Manag. Sci."},{"key":"300_CR7","volume-title":"Quadratic Programming and Affine Variational Inequalities: A Qualitative Study, Series: \u201cNonconvex Optimization and Its Applications\u201d, vol. 78","author":"G.M. Lee","year":"2005","unstructured":"Lee G.M., Tam N.N., Yen N.D.: Quadratic Programming and Affine Variational Inequalities: A Qualitative Study, Series: \u201cNonconvex Optimization and Its Applications\u201d, vol. 78. Springer, New York (2005)"},{"key":"300_CR8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1008652705980","volume":"13","author":"Z.-Q. Luo","year":"1999","unstructured":"Luo Z.-Q., Zhang S.: On extensions of the Frank\u2013Wolfe theorems. Comput. Optim. Appl. 13, 87\u2013110 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"300_CR9","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1023\/A:1008377529330","volume":"13","author":"U. Raber","year":"1998","unstructured":"Raber U.: A simplicial branch-and-bound method for solving nonconvex all-quadratic programs. J. Glob. Optim. 13, 417\u2013432 (1998)","journal-title":"J. Glob. Optim."},{"key":"300_CR10","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BFb0120850","volume":"10","author":"S.M. Robinson","year":"1979","unstructured":"Robinson S.M.: Generalized equations and their solutions: Part I, Basic theory. Math. Program. Study 10, 128\u2013141 (1979)","journal-title":"Math. Program. Study"},{"key":"300_CR11","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"300_CR12","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/0377-2217(85)90116-X","volume":"22","author":"T. Terlaky","year":"1985","unstructured":"Terlaky T.: On l p programming. Eur. J. Oper. Res. 22, 70\u2013100 (1985)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0300-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0300-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0300-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:27Z","timestamp":1559409087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0300-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,9]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["300"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0300-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,9]]}}}