{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T04:30:28Z","timestamp":1770525028816,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1023\/a:1020209017701","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T13:37:24Z","timestamp":1047735444000},"page":"163-185","source":"Crossref","is-referenced-by-count":167,"title":["Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming"],"prefix":"10.1007","volume":"24","author":[{"given":"Immanuel M.","family":"Bomze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Etienne","family":"De Klerk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"405540_CR1","first-page":"429","volume":"69","author":"M. Bellare","year":"1995","unstructured":"Bellare, M. and Rogaway, P. (1995), The Complexity of Approximating a Nonlinear Program, Mathematical Programming 69, 429\u2013441.","journal-title":"Mathematical Programming"},{"key":"405540_CR2","unstructured":"Berkelaar, A.B., Jansen, B., Roos, C. and Terlaky, T. (1996), Sensitivity Analysis in (Degenerate) Quadratic Programming. Technical Report TWI 96\u201326, Reports of the Faculty of Technical Mathematics and Informatics, Delft University of Technology."},{"key":"405540_CR3","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/A:1008369322970","volume":"13","author":"I.M. Bomze","year":"1998","unstructured":"Bomze, I.M. (1998), On Standard Quadratic Optimization Problems, Journal of Global Optimization 13, 369\u2013387.","journal-title":"Journal of Global Optimization"},{"key":"405540_CR4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"I. D. Bomze","year":"2000","unstructured":"Bomze, I.M., D\u00fcr, M., de Klerk, E., Roos, C., Quist, A. and Terlaky, T. (2000), On Copositive Programming and Standard Quadratic Optimization Problems, Journal of Global Optimization 18, 301\u2013320.","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"405540_CR5","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E. de Klerk","year":"2002","unstructured":"de Klerk, E. and Pasechnik, D.V. (2002), Approximation of the Stability Number of a Graph via Copositive Programming, SIAM Journal of Optimization 12(4), 875\u2013892.","journal-title":"SIAM Journal of Optimization"},{"key":"405540_CR6","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X. and Williamson, D.P. (1995), Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM 42, 1115\u20131145.","journal-title":"Journal of the ACM"},{"key":"405540_CR7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. Hastad","year":"1999","unstructured":"Hastad, J. (1999), Clique is Hard to Approximate Within uV u, Acta Mathematica 182, 105\u2013142.","journal-title":"Acta Mathematica"},{"key":"405540_CR8","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T.S. Motzkin","year":"1965","unstructured":"Motzkin, T.S. and Straus, E.G. (1965), Maxima for Graphs and a New Proof of a Theorem of T\u00faran, Canadian J. Math. 17, 533\u2013540.","journal-title":"Canadian J. Math."},{"key":"405540_CR9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"K.G. Murty","year":"1987","unstructured":"Murty, K.G. and Kabadi, S.N. (1987), Some NP-Complete Problems in Quadratic and Linear Programming, Mathematical Programming 39, 117\u2013129.","journal-title":"Mathematical Programming"},{"key":"405540_CR10","volume-title":"Discussion paper 9915, CORE","author":"Y.E. Nesterov","year":"1999","unstructured":"Nesterov, Y.E. (1999), Global Quadratic Optimization on the Sets with Simplex Structure. Discussion paper 9915, CORE, Katholic University of Louvain, Belgium."},{"key":"405540_CR11","volume-title":"Interior Point Methods in Convex Programming: Theory and Applications","author":"Y.E. Nesterov","year":"1994","unstructured":"Nesterov, Y.E. and Nemirovskii, A.S. (1994), Interior Point Methods in Convex Programming: Theory and Applications. SIAM, Philadelphia, PA."},{"key":"405540_CR12","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/978-1-4615-4381-7_13","volume-title":"Handbook of Semidefinite Programming","author":"Y.E. Nesterov","year":"2000","unstructured":"Nesterov, Y.E., Wolkowicz, H. and Ye, Y. (2000), Nonconvex Quadratic Optimization, in Wolkowicz, H., Saigal, R. and Vandenberghe, L. (eds.), Handbook of Semidefinite Programming, pp. 361\u2013416. Kluwer Academic Publishers, Dordrecht."},{"key":"405540_CR13","volume-title":"Combinatorial Optimization. Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H. and Steiglitz, K. (1982), Combinatorial Optimization. Algorithms and Complexity. Prentice Hall, Inc., Englewood Cliffs, N.J."},{"key":"405540_CR14","volume-title":"Structured Semidefinite Programs and Semi-algebraic Geometry Methods in Robustness and Optimization","author":"P.A. Parrilo","year":"2000","unstructured":"Parrilo, P.A. (2000), Structured Semidefinite Programs and Semi-algebraic Geometry Methods in Robustness and Optimization. PhD thesis, California Institute of Technology, Pasadena, California, USA. Available at: http:\/\/www.cds.caltech.edu\/pablo\/."},{"key":"405540_CR15","volume-title":"Minimizing polynomial functions","author":"P.A. Parrilo","year":"2001","unstructured":"Parrilo, P.A. and Sturmfels, B. (2001), Minimizing polynomial functions, Tech. Rep. math. OC\/0103170, DIMACS, Rutgers University, March."},{"key":"405540_CR16","first-page":"141","volume":"73","author":"G. P\u00f3lya","year":"1928","unstructured":"P\u00f3lya, G. (1928), Uber positive Darstellung von Polynomen. Vierteljschr. Naturforsch. Ges. \u00a8 Zurich, 73, 141\u2013145 (also Collected Papers 2, 309\u2013313, MIT Press, Cambridge, MA, London, 1974).","journal-title":"Uber positive Darstellung von Polynomen. Vierteljschr. Naturforsch. Ges. \u00a8 Zurich"},{"key":"405540_CR17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0022-4049(00)00155-9","volume":"164","author":"V. Powers","year":"2001","unstructured":"Powers, V. and Reznick, B. (2001), A New Bound for P\u00f3lya's Theorem with Applications to Polynomials Positive on Polyhedra, J. Pure Appl. Alg. 164, 221\u2013229.","journal-title":"J. Pure Appl. Alg."},{"key":"405540_CR18","doi-asserted-by":"crossref","unstructured":"J. Renegar (2001), A Mathematical View of Interior-Point Methods in Convex Optimization. Forthcoming, SIAM, Philadelphia, PA.","DOI":"10.1137\/1.9780898718812"},{"key":"405540_CR19","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1080\/10556789808805692","volume":"9","author":"A.J. Quist","year":"1998","unstructured":"Quist, A.J., de Klerk, E., Roos, C. and Terlaky, T. (1998), Copositive Relaxation for General Quadratic Programming, Optimization Methods and Software 9, 185\u2013209.","journal-title":"Optimization Methods and Software"},{"key":"405540_CR20","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J.F. Sturm","year":"1999","unstructured":"Sturm, J.F. (1999), Using SeDuMi 1.02, a MATLAB Toolbox for Optimization Over Symmetric Cones, Optimization Methods and Software 11\u201312, 625\u2013653.","journal-title":"Optimization Methods and Software"},{"key":"405540_CR21","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/S0022-5193(88)80080-8","volume":"132","author":"G.T. Vickers","year":"1988","unstructured":"Vickers, G.T. and Cannings, C. (1988), Patterns of ESS's I, J. Theor. Biol. 132, 387\u2013408.","journal-title":"J. Theor. Biol."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020209017701.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020209017701\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020209017701.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:38:30Z","timestamp":1751366310000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020209017701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["405540"],"URL":"https:\/\/doi.org\/10.1023\/a:1020209017701","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}