{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:24:28Z","timestamp":1743049468623,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":16,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_362","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T10:59:49Z","timestamp":1219661989000},"page":"2020-2029","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Likelihood Detection via Semidefinite Programming"],"prefix":"10.1007","author":[{"given":"Mikalai","family":"Kisialiou","sequence":"first","affiliation":[]},{"given":"Zhi-Quan","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"362_CR1_362","doi-asserted-by":"crossref","unstructured":"Benson SJ, Ye Y (2007) DSDP5: Software for semidefinite\nprogramming. ACM Trans Math Soft 34(3)","DOI":"10.2172\/947970"},{"key":"362_CR2_362","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization.\nCambridge University Press, New York"},{"key":"362_CR3_362","doi-asserted-by":"publisher","first-page":"463","DOI":"10.2307\/2007966","volume":"44","author":"U Fincke","year":"1985","unstructured":"Fincke U, Pohst M (1985) Improved methods for\ncalculating vectors of short length in a\u00a0lattice, including \na\u00a0complexity analysis. Math Comput 44:463\u2013471","journal-title":"Math Comput"},{"key":"362_CR4_362","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and\nsatisfiability problem using semidefinite programming. J\u00a0ACM 42:1115\u20131145","journal-title":"J ACM"},{"key":"362_CR5_362","first-page":"1982","volume":"51","author":"D Guo","year":"2005","unstructured":"Guo D, Verd\u00fa S (2005) Randomly spread CDMA:\nasymptotics via statistical physics. IEEE Trans\nInf Theory 51:1982\u20132010","journal-title":"IEEE Trans Inf Theory"},{"issue":"7","key":"362_CR6_362","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1109\/TIT.2002.1013127","volume":"48","author":"B Hassibi","year":"2002","unstructured":"Hassibi B, Hochwald BM (2002) High-rate\ncodes that are linear in space and time. IEEE\nTrans Inf Theory 48(7):1804\u20131824","journal-title":"IEEE Trans Inf Theory"},{"key":"362_CR7_362","first-page":"1051","volume":"2","author":"B Hassibi","year":"2001","unstructured":"Hassibi B, Vikalo H (2001) On the expected complexity of sphere\ndecoding. Thirty-Fifth Asilomar Conference on Signals.\nSyst Comput 2:1051\u20131055","journal-title":"Syst Comput"},{"key":"362_CR8_362","unstructured":"Jalden J (2006) Detection for multiple input\nmultiple output channels. Ph.D. Thesis, KTH, School of Electrical\nEngineering, Stockholm"},{"key":"362_CR9_362","doi-asserted-by":"crossref","unstructured":"Jalden J, Ottersten B (2004) An exponential lower bound on the\nexpected complexity of sphere decoding. Proc ICASSP '04, vol\u00a04, pp\u00a0IV\u00a0393\u2013IV\u00a0396","DOI":"10.1109\/ICASSP.2004.1326846"},{"issue":"4","key":"362_CR10_362","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1109\/TSP.2005.843746","volume":"53","author":"J Jalden","year":"2005","unstructured":"Jalden J, Ottersten B (2005) On the complexity of sphere\ndecoding in digital communications. IEEE Trans Signal Process 53(4):1474\u20131484","journal-title":"IEEE Trans Signal Process"},{"key":"362_CR11_362","doi-asserted-by":"crossref","unstructured":"Kisialiou M, Luo Z-Q (2005) Performance analysis of\nquasi-maximum-likelihood detector based on semi-definite\nprogramming. Proc ICASSP '05, vol\u00a03,\npp\u00a0III\u00a0433\u2013III\u00a0436","DOI":"10.1109\/ICASSP.2005.1415739"},{"key":"362_CR12_362","doi-asserted-by":"crossref","unstructured":"Kisialiou M, Luo Z-Q (2007) Efficient implementation of \na\u00a0quasi-maximum-likelihood detector based on semidefinite\nrelaxation. Proc ICASSP '07, vol\u00a04,\npp\u00a0IV\u00a01329\u2013IV\u00a01332","DOI":"10.1109\/ICASSP.2007.367323"},{"issue":"4","key":"362_CR13_362","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1109\/78.992139","volume":"50","author":"WK Ma","year":"2002","unstructured":"Ma WK, Davidson TN, Wong KM, Luo Z-Q, Ching PC (2002) Quasi-maximum-likelihood multiuser\ndetection using semidefinite relaxation. IEEE Trans Signal Process 50(4):912\u2013922","journal-title":"IEEE Trans Signal Process"},{"key":"362_CR14_362","unstructured":"Nesterov YE (1997) Quality of semi-difinite relaxation for nonconvex quadratic\noptimization. CORE Discussion Paper, no 9719"},{"key":"362_CR15_362","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"JF Sturm","year":"1999","unstructured":"Sturm JF (1999) Using SeDuMi 1.02, a\u00a0MATLAB toolbox for optimization over symmetric\ncones. Optim Meth Soft 11\u201312:625\u2013653","journal-title":"Optim Meth Soft"},{"issue":"5","key":"362_CR16_362","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.771234","volume":"45","author":"E Viterbo","year":"1999","unstructured":"Viterbo E, Boutros J (1999) A\u00a0universal lattice code decoder for fading channels. IEEE\nTrans Inf Theory 45(5):1639\u20131642","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_362","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:39:20Z","timestamp":1720690760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_362"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_362","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}