{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T19:17:02Z","timestamp":1772047022303,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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,1]]},"DOI":"10.1023\/a:1013819515732","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T18:50:27Z","timestamp":1041101427000},"page":"233-261","source":"Crossref","is-referenced-by-count":66,"title":["Enhancing RLT relaxations via a new class of semidefinite cuts"],"prefix":"10.1007","volume":"22","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara M. P.","family":"Fraticelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"383104_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"Alizadeh, F. (1995) Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization. SIAM Journal of Optimization 5(1), 13\u201351.","journal-title":"SIAM Journal of Optimization"},{"issue":"1","key":"383104_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. and Savard, G. (2000) Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming. Mathematical Programming 87(1), 131\u2013152.","journal-title":"Mathematical Programming"},{"key":"383104_CR3","volume-title":"Nonlinear Programming Theory and Applications","author":"M. S. Bazaraa","year":"1993","unstructured":"Bazaraa, M. S., Sherali, H. D. and Shetty, C. M., (1993) Nonlinear Programming Theory and Applications, Wiley, New York, NY, second edition.","edition":"second edition"},{"key":"383104_CR4","doi-asserted-by":"crossref","unstructured":"Bertsimas, D. and Ye, Y. (1998) Semidefinite Relaxations,Multivariate Normal Distributions and Order Statistics. In: D.-Z. Du and P. M. Pardalos (eds.): Handbook of Combinatorial Optimization, Vol. 3. Kluwer Academic Publishers, pp. 1\u201319.","DOI":"10.1007\/978-1-4613-0303-9_24"},{"key":"383104_CR5","unstructured":"Burer, S. and Monteiro, R. (1998) A Nonlinear Programming Algorithm for Solving Semidefinite Programs via Low-rank Factorization. Presented at the ISMP Conference, Atlanta, GA."},{"issue":"6","key":"383104_CR6","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"Goemans, M. and Williamson, D. (1995), Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming Journal of the Association for Computational Machinery 42(6), 1115\u20131145.","journal-title":"Journal of the Association for Computational Machinery"},{"key":"383104_CR7","first-page":"98","volume-title":"A Global Optimality Criterion for Non-Convex Quadratic Programming Over a Simplex","author":"I. Nowak","year":"1998","unstructured":"Nowak, I. (1998) A Global Optimality Criterion for Non-Convex Quadratic Programming Over a Simplex. Pre-Print 98\u201317, Humboldt University, Berlin. Available online at http:\/\/wwwiam. mathematik.hu-berlin.de\/ivo\/ivopages\/work.html."},{"key":"383104_CR8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1093\/imamat\/10.3.373","volume":"10","author":"C.C. Paige","year":"1972","unstructured":"Paige, C.C. (1972) Computational Variants of the Lanczos Method for the Eigen-problems. Journal of the Institute of Mathematics and Its Applications 10, 373\u2013381.","journal-title":"Journal of the Institute of Mathematics and Its Applications"},{"key":"383104_CR9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01100204","volume":"7","author":"M. Ramana","year":"1995","unstructured":"Ramana, M. and Goldman, A. J. (1995), Some Geometric Results in Semidefinite Programming. Journal of Global Optimization 7, 33\u201350.","journal-title":"Journal of Global Optimization"},{"key":"383104_CR10","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/978-1-4613-3449-1_9","volume-title":"Interior Point Methods of Mathematical Programming","author":"M. Ramana","year":"1996","unstructured":"Ramana, M. and Pardalos, P. M. (1996) Semidefinite Programming. In: T. Terlaky (ed.): Interior Point Methods of Mathematical Programming. Kluwer Academic Publishers, Dordrecht, pp. 369\u2013398."},{"key":"383104_CR11","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. and Adams, W. P. (1999), A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Boston, MA: Kluwer Academic Publishing."},{"key":"383104_CR12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"H. D. Sherali","year":"1992","unstructured":"Sherali, H. D. and Tuncbilek, C. H. (1992), A Global Optimization Algorithm for Polynomial Programming PRoblems Using a Reformulation-Linearization Technique. Journal of Global Optimization 2, 101\u2013112.","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"383104_CR13","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. and Tuncbilek, C. H. (1997), Reformulation-Linearization\/Convexification Relaxations for Univariate and Multivariate Polynomial Programming Problems. Operations Research Letters 21(1), 1\u201310.","journal-title":"Operations Research Letters"},{"issue":"3","key":"383104_CR14","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/PL00011409","volume":"89","author":"H. D. Sherali","year":"2001","unstructured":"Sherali, H. D. and Wang, H. (2001), Global Optimization of Nonconvex Factorable Programming Problems. Mathematical Programming 89(3), 459\u2013478.","journal-title":"Mathematical Programming"},{"key":"383104_CR15","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. (1998), Nondifferentiable Optimization and Polynomial Problems. Boston, MA: Kluwer Academic Publishing."},{"key":"383104_CR16","unstructured":"Todd, M. J. (1998), Semidefinite Programming Applications, Duality, and Interior-Point Methods. Presented at the Fall INFORMS meeting, Seattle,WA. Also available on the WorldWide Web at http:\/\/www.orie.cornell.edu\/mike-todd\/todd.html."},{"issue":"1","key":"383104_CR17","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenbergh","year":"1996","unstructured":"Vandenbergh, L. and Boyd, S. (1996), Semidefinite Programming. SIAM Review 38(1), 49\u201395.","journal-title":"SIAM Review"},{"key":"383104_CR18","volume-title":"On Formulating Semidefinite Programming Problems as Smooth Convex Nonlinear Optimization Problems","author":"R.J. Vanderbei","year":"2000","unstructured":"Vanderbei, R.J. and Benson, H. Y. (2000), On Formulating Semidefinite Programming Problems as Smooth Convex Nonlinear Optimization Problems. Working paper, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ."},{"key":"383104_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of Semidefinite Progamming: Theory and Algorithms, and Applications","author":"H. Wolkowicz","year":"2000","unstructured":"Wolkowicz, H., Saigal, R. and Vandenbergh, L. 2000, Handbook of Semidefinite Progamming: Theory and Algorithms, and Applications. Boston, MA: Kluwer Academic Publishers."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013819515732.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013819515732\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013819515732.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:46:40Z","timestamp":1751366800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013819515732"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":19,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["383104"],"URL":"https:\/\/doi.org\/10.1023\/a:1013819515732","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}