{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T03:53:26Z","timestamp":1727063606501},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,5,10]],"date-time":"2014-05-10T00:00:00Z","timestamp":1399680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10898-014-0195-x","type":"journal-article","created":{"date-parts":[[2014,5,9]],"date-time":"2014-05-09T08:04:02Z","timestamp":1399622642000},"page":"459-478","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Conic approximation to nonconvex quadratic programming with convex quadratic constraints"],"prefix":"10.1007","volume":"61","author":[{"given":"Zhibin","family":"Deng","sequence":"first","affiliation":[]},{"given":"Shu-Cherng","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Qingwei","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Cheng","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,10]]},"reference":[{"key":"195_CR1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM 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":"195_CR2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s101079900106","volume":"87","author":"C Audet","year":"2000","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: A branch and cut algorithm for nonconvex quadratically constrained quadratic programs. Math. Programm. 87, 131\u2013152 (2000)","journal-title":"Math. Programm."},{"key":"195_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization, Analysis, Algorithms and Engineering Applications. MPS\/SIAM Series on Optimization","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization, Analysis, Algorithms and Engineering Applications. MPS\/SIAM Series on Optimization. SIAM, Philadelphia (2001)"},{"key":"195_CR4","volume-title":"Convex Optimization","author":"S Boyd","year":"2009","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2009)"},{"key":"195_CR5","unstructured":"Burer, S., Anstreicher, K.M.: Second-order-cone constraint for extended trust-region subproblems. SIAM J. Optim. 23(1), 432\u2013451 (2013)"},{"key":"195_CR6","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"113","author":"S Burer","year":"2008","unstructured":"Burer, S., Vandenbussche, D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Programm. 113, 259\u2013282 (2008)","journal-title":"Math. Programm."},{"key":"195_CR7","unstructured":"Celis, M.R., Dennis, J.E., Tapia, R.A.: A trust region strategy for nonliear equality constrained optimization. In: Boggs, P.T., Byrd, R.H., Schnabel, R.B. (eds.) Numerical Optimzation 1984: Procedding of the SIAM Conference on Numerical Optimization, Boulder, Colorado, pp. 71\u201382. SIAM, Philadelphia (1985)"},{"key":"195_CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods. MPS\/SIAM Series on Optimization","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. MPS\/SIAM Series on Optimization. SIAM, Philadelphia (2000)"},{"key":"195_CR9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/99.714603","volume":"5","author":"J Czyzyk","year":"1998","unstructured":"Czyzyk, J., Mesnier, M., Mor\u00e9, J.: The NEOS server. J. IEEE Comput. Sci. Eng. 5, 68\u201375 (1998)","journal-title":"J. IEEE Comput. Sci. Eng."},{"key":"195_CR10","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 1.21. http:\/\/cvxr.com\/cvx\/ , April (2011)"},{"key":"195_CR11","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1137\/100793955","volume":"21","author":"C Lu","year":"2011","unstructured":"Lu, C., Fang, S.-C., Jin, Q., Wang, Z., Xing, W.: KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems. SIAM J. Optim. 21, 1475\u20131490 (2011)","journal-title":"SIAM J. Optim."},{"key":"195_CR12","unstructured":"Lu, C., Jin, Q., Fang, S.-C., Wang, Z., Xing, W.: Adaptive computable approximation to cones of nonnegative quadratic functions. Optimization (2014, to appear). doi: 10.1080\/02331934.2014.8958993"},{"key":"195_CR13","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/MSP.2010.936019","volume":"27","author":"Z-Q Luo","year":"2010","unstructured":"Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., Zhang, S.: Semidefinite relaxation of quadratic optimization problems. IEEE Signal Process. Mag. 27, 20\u201334 (2010)","journal-title":"IEEE Signal Process. Mag."},{"key":"195_CR14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P Pardalos","year":"1991","unstructured":"Pardalos, P., Vavasis, S.: Quadratic programming with one negative eigenvalue is NP-hard. J. Glob. Optim. 1, 15\u201322 (1991)","journal-title":"J. Glob. Optim."},{"key":"195_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S Poljak","year":"1995","unstructured":"Poljak, S., Rendl, F., Wolkowicz, H.: A recipe for semidefinite relaxation for (0, 1)-quadratic programming. J. Glob. Optim. 7, 51\u201373 (1995)","journal-title":"J. Glob. Optim."},{"key":"195_CR16","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1080\/10556789808805692","volume":"9","author":"AJ Quist","year":"1998","unstructured":"Quist, A.J., de Klerk, E., Roos, C., Terlaky, T.: Copositive relaxation for genreal quadratic programming. Optim. Methods Softw. 9, 185\u2013208 (1998)","journal-title":"Optim. Methods Softw."},{"key":"195_CR17","first-page":"273","volume":"77","author":"F Rendl","year":"1997","unstructured":"Rendl, F., Wolkowicz, H.: A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Program. 77, 273\u2013299 (1997)","journal-title":"Math. Program."},{"key":"195_CR18","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1972","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, New Jersey (1972)"},{"key":"195_CR19","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8, 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"key":"195_CR20","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discret. Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Discret. Math."},{"key":"195_CR21","first-page":"1","volume":"25","author":"NZ Shor","year":"1987","unstructured":"Shor, N.Z.: Quadratic optimization problems. Sov. J. Comput. Syst. Sci. 25, 1\u201311 (1987)","journal-title":"Sov. J. Comput. Syst. Sci."},{"key":"195_CR22","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1287\/moor.28.2.246.14485","volume":"28","author":"JF Sturm","year":"2003","unstructured":"Sturm, J.F., Zhang, S.: On cones of nonnegative quadratic functions. Math. Oper. Res. 28, 246\u2013267 (2003)","journal-title":"Math. Oper. Res."},{"key":"195_CR23","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1137\/S105262340139001X","volume":"14","author":"Y Ye","year":"2003","unstructured":"Ye, Y., Zhang, S.: New results on quadratic minimization. SIAM J. Optim. 14, 245\u2013267 (2003)","journal-title":"SIAM J. Optim."},{"key":"195_CR24","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1007\/s10898-010-9630-9","volume":"50","author":"XJ Zheng","year":"2011","unstructured":"Zheng, X.J., Sun, X.L., Li, D.: Nonconvex quadratically constrained quadratic programming: best D.C. decomposition and their SDP represetations. J. Glob. Optim. 50, 695\u2013712 (2011)","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0195-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0195-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0195-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:59:07Z","timestamp":1559278747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0195-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,10]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["195"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0195-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,10]]}}}