{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T21:33:31Z","timestamp":1770413611635,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T00:00:00Z","timestamp":1314748800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10589-011-9425-z","type":"journal-article","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T16:38:20Z","timestamp":1314722300000},"page":"483-506","source":"Crossref","is-referenced-by-count":15,"title":["Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts"],"prefix":"10.1007","volume":"52","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[]},{"given":"Evrim","family":"Dalkiran","sequence":"additional","affiliation":[]},{"given":"Jitamitra","family":"Desai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,31]]},"reference":[{"issue":"4","key":"9425_CR1","doi-asserted-by":"crossref","first-page":"1735","DOI":"10.1137\/07070601X","volume":"19","author":"W. Ai","year":"2009","unstructured":"Ai, W., Zhang, S.: Strong duality for the CDT subproblem: a necessary and sufficient condition. SIAM J. Optim. 19(4), 1735\u20131756 (2009)","journal-title":"SIAM J. Optim."},{"issue":"2\u20133","key":"9425_CR2","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(2\u20133), 471\u2013484 (2009)","journal-title":"J. Glob. Optim."},{"key":"9425_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/0471787779","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"M.S. Bazaraa","year":"2006","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 3rd edn. Wiley, New York (2006)","edition":"3"},{"key":"9425_CR4","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. Program., Ser. A 113, 259\u2013282 (2008)","journal-title":"Math. Program., Ser. A"},{"issue":"2","key":"9425_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10589-007-9137-6","volume":"43","author":"S. Burer","year":"2009","unstructured":"Burer, S., Vandenbussche, D.: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. Comput. Optim. Appl. 43(2), 181\u2013195 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"9425_CR6","unstructured":"Dalkiran, E.: Discrete and continuous nonconvex optimization: decision trees, valid inequalities, and reduced basis techniques. Ph.D. thesis, Virginia Tech (2011)"},{"key":"9425_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3040-1","volume-title":"Handbook of Test Problems in Local and Global Optimization","author":"C.A. Floudas","year":"1999","unstructured":"Floudas, C.A., Pardalos, P.M., Adjiman, J.S., Esposito, W.R., Gumus, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic, Dordrecht (1999)"},{"issue":"1","key":"9425_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"P.E. Gill","year":"2005","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: An SQP algorithm for large-scale constrained optimization. SIAM Rev. 47(1), 99\u2013131 (2005)","journal-title":"SIAM Rev."},{"issue":"3","key":"9425_CR9","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0377-2217(01)00143-6","volume":"137","author":"C. Helmberg","year":"2002","unstructured":"Helmberg, C.: Semidefinite programming. Eur. J. Oper. Res. 137(3), 461\u2013482 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9425_CR10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/779359.779363","volume":"29","author":"D. Henrion","year":"2003","unstructured":"Henrion, D., Lasserre, J.B.: GloptiPoly: global optimization over polynomials with Matlab and SeDuMi. ACM Trans. Math. Softw. 29(2), 165\u2013194 (2003)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"9425_CR11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0377-2217(02)00298-9","volume":"143","author":"M. Kojima","year":"2002","unstructured":"Kojima, M., Tun\u00e7el, L.: On the finite convergence of successive SDP relaxation methods. Eur. J. Oper. Res. 143(2), 325\u2013341 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9425_CR12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1021985014197","volume":"25","author":"H. Konno","year":"2003","unstructured":"Konno, H., Kawadai, N., Tuy, H.: Cutting plane algorithms for nonlinear semidefinite programming problems with applications. J. Glob. Optim. 25(2), 141\u2013155 (2003)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9425_CR13","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J.B. Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9425_CR14","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1137\/S1052623400380079","volume":"12","author":"J.B. Lasserre","year":"2002","unstructured":"Lasserre, J.B.: An explicit equivalent positive semidefinite program for nonlinear 0-1 programs. SIAM J. Control Optim. 12(3), 756\u2013769 (2002)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"9425_CR15","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/moor.27.2.347.322","volume":"27","author":"J.B. Lasserre","year":"2002","unstructured":"Lasserre, J.B.: Semidefinite programming vs. LP relaxations for polynomial programming. Math. Oper. Res. 27(2), 347\u2013360 (2002)","journal-title":"Math. Oper. Res."},{"key":"9425_CR16","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0927-0507(05)12008-8","volume-title":"Handbook on Discrete Optimization","author":"M. Laurent","year":"2005","unstructured":"Laurent, M., Rendl, F.: Semidefinite programming and integer programming. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Handbook on Discrete Optimization, pp. 393\u2013514. Elsevier, Amsterdam (2005)"},{"key":"9425_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61582-5","volume-title":"More test examples for nonlinear programming codes","author":"K. Schittkowski","year":"1987","unstructured":"Schittkowski, K.: More test examples for nonlinear programming codes. Springer, New York (1987)"},{"key":"9425_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"H.D. Sherali","year":"1999","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Dordrecht (1999)"},{"key":"9425_CR19","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1013819515732","volume":"22","author":"H.D. Sherali","year":"2002","unstructured":"Sherali, H.D., Fraticelli, B.M.P.: Enhancing RLT relaxations via a new class of semidefinite cuts. J.\u00a0Glob. Optim. 22, 233\u2013261 (2002)","journal-title":"J.\u00a0Glob. Optim."},{"issue":"1","key":"9425_CR20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"H.D. Sherali","year":"1992","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Glob. Optim. 2(1), 101\u2013112 (1992)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9425_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"H.D. Sherali","year":"1995","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Glob. Optim. 7(1), 1\u201331 (1995)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"9425_CR22","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1023\/A:1008237515535","volume":"10","author":"H.D. Sherali","year":"1997","unstructured":"Sherali, H.D., Tuncbilek, C.H.: Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems. J. Glob. Optim. 10(4), 381\u2013390 (1997)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9425_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(97)00013-8","volume":"21","author":"H.D. Sherali","year":"1997","unstructured":"Sherali, H.D., Tuncbilek, C.H.: New reformulation linearization\/convexification relaxations for univariate and multivariate polynomial programming problems. Oper. Res. Lett. 21(1), 1\u20139 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"9425_CR24","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/PL00011409","volume":"89","author":"H.D. Sherali","year":"2001","unstructured":"Sherali, H.D., Wang, H.: Global optimization of nonconvex factorable programming problems. Math. Program. 89(3), 459\u2013478 (2001)","journal-title":"Math. Program."},{"key":"9425_CR25","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02283692","volume":"25","author":"N.Z. Shor","year":"1990","unstructured":"Shor, N.Z.: Dual quadratic estimates in polynomial and Boolean programming. Ann. Oper. Res. 25, 163\u2013168 (1990)","journal-title":"Ann. Oper. Res."},{"key":"9425_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6015-6","volume-title":"Nondifferentiable Optimization and Polynomial Problems","author":"N.Z. Shor","year":"1998","unstructured":"Shor, N.Z.: Nondifferentiable Optimization and Polynomial Problems. Kluwer Academic, Dordrecht (1998)"},{"key":"9425_CR27","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M. Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"9425_CR28","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"J.F. Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\u201312, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"9425_CR29","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38(1), 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"9425_CR30","unstructured":"Vanderbei, R.J., Benson, H.Y.: On formulating semidefinite programming problems as smooth convex nonlinear optimization problems. Technical report, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ (1999)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9425-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9425-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9425-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:41Z","timestamp":1559302601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9425-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,31]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9425"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9425-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,31]]}}}