{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:35:50Z","timestamp":1761896150086,"version":"3.37.3"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1334327"],"award-info":[{"award-number":["CMMI-1334327"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1333902"],"award-info":[{"award-number":["CMMI-1333902"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-11-1-0260"],"award-info":[{"award-number":["FA9550-11-1-0260"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-11-1-0151"],"award-info":[{"award-number":["FA9550-11-1-0151"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10107-015-0951-9","type":"journal-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T02:35:46Z","timestamp":1443666946000},"page":"109-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["On conic QPCCs, conic QCQPs and completely positive programs"],"prefix":"10.1007","volume":"159","author":[{"given":"Lijie","family":"Bai","sequence":"first","affiliation":[]},{"given":"John E.","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"Jong-Shi","family":"Pang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,1]]},"reference":[{"issue":"1","key":"951_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.4171\/PM\/1881","volume":"68","author":"AY Alfakih","year":"2011","unstructured":"Alfakih, A.Y., Anjos, M.F., Piccialli, V., Wolkowicz, H.: Euclidean distance matrices, semidefinite programming, and sensor network localization. Portugal Math 68(1), 53\u2013102 (2011)","journal-title":"Portugal Math"},{"issue":"1","key":"951_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95(1), 3\u201351 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"951_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10107-012-0602-3","volume":"136","author":"KM Anstreicher","year":"2012","unstructured":"Anstreicher, K.M.: On convex relaxations for quadratically constrained quadratic programming. Math. Program. 136(2), 233\u2013251 (2012)","journal-title":"Math. Program."},{"key":"951_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/PL00011377","volume":"88","author":"A Auslender","year":"2000","unstructured":"Auslender, A.: Existence of optimal solutions and duality results under weak conditions. Math. Program. 88, 45\u201359 (2000)","journal-title":"Math. Program."},{"key":"951_CR5","volume-title":"Asymptotic Cones and Functions in Optimization and Variational Inequalities","author":"A Auslender","year":"2003","unstructured":"Auslender, A., Teboulle, M.: Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer, New York (2003)"},{"issue":"3","key":"951_CR6","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10589-012-9497-4","volume":"54","author":"L Bai","year":"2013","unstructured":"Bai, L., Mitchell, J.E., Pang, J.S.: On convex quadratic programs with linear complementarity constraints. Comput. Optim. Appl. 54(3), 517\u2013554 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"951_CR7","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s11590-013-0647-0","volume":"8","author":"L Bai","year":"2014","unstructured":"Bai, L., Mitchell, J.E., Pang, J.S.: Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints. Optim. Lett. 8(3), 811\u2013822 (2014)","journal-title":"Optim. Lett."},{"issue":"4\u20135","key":"951_CR8","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/10556780902883184","volume":"24","author":"X Bao","year":"2009","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs. Optim. Methods Softw. 24(4\u20135), 485\u2013504 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"951_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10107-011-0462-2","volume":"129","author":"X Bao","year":"2011","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Semidefinite relaxations for quadratically constrained quadratic programs: a review and comparisons. Math. Program. 129(1), 129\u2013157 (2011)","journal-title":"Math. Program."},{"key":"951_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s101070050083","volume":"86","author":"HH Bauschke","year":"1999","unstructured":"Bauschke, H.H., Borwein, J.M., Li, W.: Strong conical hull intersection property, bounded linear regularity, Jameson\u2019s property (G), and error bounds in convex optimization. Math. Program. 86, 135\u2013160 (1999)","journal-title":"Math. Program."},{"key":"951_CR11","volume-title":"Introduction to Convex Analysis and Integer Programming","author":"EG Belousov","year":"1977","unstructured":"Belousov, E.G.: Introduction to Convex Analysis and Integer Programming. Moscow University Publications, Moscow (1977). In Russian"},{"key":"951_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1014813701864","volume":"22","author":"EG 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":"951_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10107-006-0003-6","volume":"110","author":"DP Bertsekas","year":"2007","unstructured":"Bertsekas, D.P., Tseng, P.: Set intersection theorems and existence of optimal solutions. Math. Program. 110, 287\u2013314 (2007)","journal-title":"Math. Program."},{"issue":"2","key":"951_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., de Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24(2), 163\u2013185 (2002)","journal-title":"J. Global Optim."},{"issue":"4","key":"951_CR15","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"IM Bomze","year":"2000","unstructured":"Bomze, I.M., D\u00fcr, M., de Klerk, E., Roos, C., Quist, A.J., Terlaky, T.: On copositive programming and standard quadratic optimization problems. J. Glob. Optim. 18(4), 301\u2013320 (2000)","journal-title":"J. Glob. Optim."},{"key":"951_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-9859-3","volume-title":"Convex Analysis and Nonlinear Optimization","author":"JM Borwein","year":"2000","unstructured":"Borwein, J.M., Lewis, A.S.: Convex Analysis and Nonlinear Optimization. Springer, New York (2000)"},{"key":"951_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01589443","volume":"35","author":"JM Borwein","year":"1986","unstructured":"Borwein, J.M., Wolkowicz, H.: A simple constraint qualification in infinite dimensional programming. Math. Program. 35, 83\u201396 (1986)","journal-title":"Math. Program."},{"key":"951_CR18","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1016\/j.laa.2007.09.035","volume":"428","author":"S Bundfuss","year":"2008","unstructured":"Bundfuss, S., D\u00fcr, M.: Algorithmic copositivity detection by simplicial partition. Linear Algebra Appl. 428, 1511\u20131523 (2008)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"951_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/070711815","volume":"20","author":"S Bundfuss","year":"2009","unstructured":"Bundfuss, S., D\u00fcr, M.: An adaptive linear approximation algorithm for copositive programs. SIAM J. Optim. 20(1), 30\u201353 (2009)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"951_CR20","doi-asserted-by":"publisher","first-page":"1741","DOI":"10.1090\/S0002-9939-04-07844-X","volume":"133","author":"RS Burachik","year":"2004","unstructured":"Burachik, R.S., Jeyakumar, V.: A simple closure condition for the normal cone intersection formula. Proc. Am. Math. Soc. 133(6), 1741\u20131748 (2004)","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"951_CR21","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120(2), 479\u2013495 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"951_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-010-0010-8","volume":"2","author":"S Burer","year":"2010","unstructured":"Burer, S.: Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Math. Prog. Comput. 2(1), 1\u201319 (2010)","journal-title":"Math. Prog. Comput."},{"key":"951_CR23","first-page":"201","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operational Research and Management Science","author":"S Burer","year":"2012","unstructured":"Burer, S.: Copositive programming. In: Anjos, M., Lasserre, J. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operational Research and Management Science, pp. 201\u2013218. Springer, Berlin (2012)"},{"issue":"1","key":"951_CR24","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10107-015-0888-z","volume":"151","author":"S Burer","year":"2015","unstructured":"Burer, S.: A gentle, geometric introduction to copositive programming. Math. Program. 151(1), 89\u2013116 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"951_CR25","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.orl.2012.02.001","volume":"40","author":"S Burer","year":"2012","unstructured":"Burer, S., Dong, H.: Representing quadratically constrained quadratic programs as generalized copositive programs. Operat. Res. Lett. 40(3), 203\u2013206 (2012)","journal-title":"Operat. Res. Lett."},{"issue":"2","key":"951_CR26","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1137\/090761793","volume":"21","author":"V Chandrasekaran","year":"2011","unstructured":"Chandrasekaran, V., Sanghavi, S., Parrilo, P.A., Willsky, A.S.: Rank-sparsity incoherence for matrix decomposition. SIAM J. Optim. 21(2), 572\u2013596 (2011)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"951_CR27","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s11228-009-0112-5","volume":"17","author":"X Chen","year":"2009","unstructured":"Chen, X., Ye, J.J.: A class of quadratic programs with linear complementarity constraints. Set Valued Variat. Anal. 17(2), 113\u2013133 (2009)","journal-title":"Set Valued Variat. Anal."},{"issue":"4","key":"951_CR28","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1287\/opre.1060.0286","volume":"54","author":"G Codato","year":"2006","unstructured":"Codato, G., Fischetti, M.: Combinatorial Benders\u2019 cuts for mixed-integer linear programming. Oper. Res. 54(4), 758\u2013766 (2006)","journal-title":"Oper. Res."},{"key":"951_CR29","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E de Klerk","year":"2002","unstructured":"de Klerk, E., Pasechnik, D.V.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12, 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"key":"951_CR30","unstructured":"Dickinson, P.J.C.: The Copositive Cone, The Completely Positive Cone and Their Generalizations. PhD thesis, University of Groningen (2013)"},{"issue":"6","key":"951_CR31","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1007\/s11590-013-0645-2","volume":"7","author":"PJC Dickinson","year":"2013","unstructured":"Dickinson, P.J.C., Eichfelder, G., Povh, J.: Erratum to: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets. Optim. Lett. 7(6), 1387\u20131397 (2013)","journal-title":"Optim. Lett."},{"issue":"2","key":"951_CR32","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10589-013-9594-z","volume":"57","author":"PJC Dickinson","year":"2014","unstructured":"Dickinson, P.J.C., Gijben, L.: On the computational complexity of membership problems for the completely positive cone and its dual. Comput. Optim. Appl. 57(2), 403\u2013415 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"951_CR33","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10107-013-0735-z","volume":"147","author":"C Ding","year":"2014","unstructured":"Ding, C., Sun, D., Ye, J.: First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints. Math. Program. 147(1\u20132), 539\u2013579 (2014)","journal-title":"Math. Program."},{"key":"951_CR34","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-12598-0_1","volume-title":"Recent Advances in Optimization and its Applications in Engineering","author":"M D\u00fcr","year":"2010","unstructured":"D\u00fcr, M.: Copositive programming\u2014a survey. In: Diehl, M., Glineur, F., Jarlebring, E., Michiels, W. (eds.) Recent Advances in Optimization and its Applications in Engineering, pp. 3\u201320. Springer, Berlin (2010)"},{"key":"951_CR35","unstructured":"Feng, M., Mitchell, J.E., Pang, J.S., Shen, X., W\u00e4chter, A.: Complementarity Formulations of l0-Norm Optimization Problems. Technical Report, Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY (2013)"},{"key":"951_CR36","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Quart. 3, 149\u2013154 (1956)","journal-title":"Nav. Res. Logist. Quart."},{"key":"951_CR37","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-1-4615-4381-7_12","volume-title":"Handbook of Semidefinite Programming","author":"MX Goemans","year":"2000","unstructured":"Goemans, M.X., Rendl, F.: Combinatorial optimization. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of Semidefinite Programming, pp. 343\u2013360. Kluwer, Dordrecht (2000)"},{"issue":"6","key":"951_CR38","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"951_CR39","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10107-010-0426-y","volume":"133","author":"J Hu","year":"2012","unstructured":"Hu, J., Mitchell, J.E., Pang, J.S.: An LPCC approach to nonconvex quadratic programs. Math. Program. 133(1\u20132), 243\u2013277 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"951_CR40","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/07068463x","volume":"19","author":"J Hu","year":"2008","unstructured":"Hu, J., Mitchell, J.E., Pang, J.S., Bennett, K.P., Kunapuli, G.: On the global solution of linear programs with linear complementarity constraints. SIAM J. Optim. 19(1), 445\u2013471 (2008)","journal-title":"SIAM J. Optim."},{"key":"951_CR41","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1008696504163","volume":"13","author":"H Jiang","year":"1999","unstructured":"Jiang, H., Ralph, D.: QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints. Comput. Optim. Appl. 13, 25\u201359 (1999)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"951_CR42","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10898-013-0128-0","volume":"60","author":"J Lee","year":"2014","unstructured":"Lee, J., Zou, B.: Optimal rank-sparsity decomposition. J. Glob. Optim. 60(2), 307\u2013315 (2014)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"951_CR43","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10107-005-0582-7","volume":"103","author":"JT Linderoth","year":"2005","unstructured":"Linderoth, J.T.: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math. Program. 103(2), 251\u2013282 (2005)","journal-title":"Math. Program."},{"issue":"4","key":"951_CR44","doi-asserted-by":"publisher","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(4), 1475\u20131490 (2011)","journal-title":"SIAM J. Optim."},{"key":"951_CR45","unstructured":"Lu, C., Jin, Q., Fang, S.-C., Wang, Z., Xing, W.: Adaptive Computable Approximation to Cones of Nonnegative Quadratic Functions. Technical Report, Department of Mathematical Sciences, Tsinghua University, Beijing, China, (2012)"},{"key":"951_CR46","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983658","volume-title":"Mathematical Programs with Equilibrium Constraints","author":"Z-Q Luo","year":"1996","unstructured":"Luo, Z.-Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)"},{"issue":"1","key":"951_CR47","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1137\/0802004","volume":"2","author":"ZQ Luo","year":"1992","unstructured":"Luo, Z.Q., Tseng, P.: Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem. SIAM J. Optim. 2(1), 43\u201354 (1992)","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"951_CR48","doi-asserted-by":"publisher","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(1\u20133), 87\u2013110 (1999)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"951_CR49","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1080\/10556788.2012.749876","volume":"29","author":"JE Mitchell","year":"2014","unstructured":"Mitchell, J.E., Pang, J.S., Yu, B.: Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs. Optim. Methods Softw. 29(1), 120\u2013136 (2014)","journal-title":"Optim. Methods Softw."},{"key":"951_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2825-5","volume-title":"Nonsmooth Approach to Optimization Problems with Equilibrium Constraints","author":"JV Outrata","year":"1998","unstructured":"Outrata, J.V., Ko\u00e7vara, M., Zowe, J.: Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer, Dordrecht (1998)"},{"key":"951_CR51","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10957-006-9039-2","volume":"128","author":"A Ozdaglar","year":"2006","unstructured":"Ozdaglar, A., Tseng, P.: Existence of global minima for constrained optimization. J. Optim. Theory Appl. 128, 523\u2013546 (2006)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"951_CR52","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10107-010-0395-1","volume":"125","author":"JS Pang","year":"2010","unstructured":"Pang, J.S.: Three modeling paradigms in mathematical programming. Math. Program. 125(2), 297\u2013323 (2010)","journal-title":"Math. Program."},{"issue":"1","key":"951_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.25.1.1.15213","volume":"25","author":"H Scheel","year":"2000","unstructured":"Scheel, H., Scholtes, S.: Mathematical programs with complementarity constraints: stationarity, optimality, and sensitivity. Math. Operat. Res. 25(1), 1\u201322 (2000)","journal-title":"Math. Operat. Res."},{"issue":"3","key":"951_CR54","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1287\/opre.1030.0102","volume":"52","author":"S Scholtes","year":"2004","unstructured":"Scholtes, S.: Nonconvex structures in nonlinear programming. Oper. Res. 52(3), 368\u2013383 (2004)","journal-title":"Oper. Res."},{"key":"951_CR55","first-page":"795","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operational Research and Management Science","author":"R Sotirov","year":"2012","unstructured":"Sotirov, R.: SDP relaxations for some combinatorial optimization problems. In: Anjos, M., Lasserre, J. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operational Research and Management Science, pp. 795\u2013820. Springer, Berlin (2012)"},{"issue":"1\u20132","key":"951_CR56","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10107-012-0601-4","volume":"143","author":"J Sponsel","year":"2014","unstructured":"Sponsel, J., D\u00fcr, M.: Factorization and cutting planes for completely positive matrices by copositive projection. Math. Program. 143(1\u20132), 211\u2013229 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"951_CR57","doi-asserted-by":"publisher","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. Operat. Res. 28(2), 246\u2013267 (2003)","journal-title":"Math. Operat. Res."},{"key":"951_CR58","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/0377-2217(85)90116-X","volume":"22","author":"T Terlaky","year":"1985","unstructured":"Terlaky, T.: On $$\\ell _p$$ programming. Eur. J. Oper. Res. 22, 70\u2013100 (1985)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"951_CR59","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1080\/10556788.2010.540014","volume":"27","author":"EA Y\u0131ld\u0131r\u0131m","year":"2012","unstructured":"Y\u0131ld\u0131r\u0131m, E.A.: On the accuracy of uniform polyhedral approximations of the copositive cone. Optim. Methods Softw. 27(1), 155\u2013173 (2012)","journal-title":"Optim. Methods Softw."},{"key":"951_CR60","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-1-4614-0769-0_12","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization","author":"A Yoshise","year":"2012","unstructured":"Yoshise, A.: Complementarity problems over symmetric cones: A survey of recent developments in several aspects. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, pp. 339\u2013376. Springer, Berlin (2012)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0951-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0951-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0951-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0951-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:16:47Z","timestamp":1589645807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0951-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,1]]},"references-count":60,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["951"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0951-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2015,10,1]]},"assertion":[{"value":"26 January 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}