{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:13:49Z","timestamp":1648656829201},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,7,13]],"date-time":"2006-07-13T00:00:00Z","timestamp":1152748800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1007\/s11277-006-9063-4","type":"journal-article","created":{"date-parts":[[2006,7,12]],"date-time":"2006-07-12T04:32:14Z","timestamp":1152678734000},"page":"15-24","source":"Crossref","is-referenced-by-count":0,"title":["The Application of Successive Quadratic Programming Algorithm to Multiuser Detection in CDMA"],"prefix":"10.1007","volume":"39","author":[{"given":"Xuewen","family":"Mu","sequence":"first","affiliation":[]},{"given":"Sanyang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"9063_CR1","volume-title":"Multiuser Detection","author":"S. Verdu","year":"1998","unstructured":"S. Verdu, Multiuser Detection, Cambridge University Press: Cambridge, 1998."},{"issue":"8","key":"9063_CR2","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.1109\/49.942507","volume":"19","author":"H.T. Peng","year":"2001","unstructured":"H.T. Peng and L.K. Rasmussen, \u201cThe Application of Semidefinite Programming for Detection in CDMA\u201d, IEEE Selected in Communication, Vol. 19, No. 8, pp. 1442\u20131449, 2001.","journal-title":"IEEE Selected in Communication"},{"issue":"5","key":"9063_CR3","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1109\/26.87163","volume":"39","author":"L. Wei","year":"1991","unstructured":"L. Wei, L. Krasmussen, and R. Wyrwas, \u201cNear Optimum Tree-Search Detection Schemes for Bit-Synchronous Multiuser CDMA System Over Gaussian and Two-Path Rayleigh-Fading Channels\u201d, IEEE Trans. Communication, Vol. 39, No 5, pp. 725\u2013736, 1991.","journal-title":"IEEE Trans. Communication"},{"issue":"3","key":"9063_CR4","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1109\/78.747786","volume":"47","author":"Sharfer","year":"1999","unstructured":"Sharfer and A.O. Hero, \u201cA Maximum Likelihood Digital Receiver Using Coordinate Ascent and the Discrete Wavelet Transform\u201d, IEEE Trans. Signal Processing, Vol. 47, No. 3,pp. 813\u2013825, 1999.","journal-title":"IEEE Trans. Signal Processing"},{"issue":"9","key":"9063_CR5","doi-asserted-by":"crossref","first-page":"2446","DOI":"10.1109\/TSP.2003.815382","volume":"51","author":"X.M. Wang","year":"2003","unstructured":"X.M. Wang, W. S. Lu, and A. Antoniou, \u201cA Near-Optimal Detector for DS-CDMA Systems Using Semidefinite Programming Relaxation\u201d, IEEE Trans, Signal Processing, Vol. 51, No. 9, pp. 2446\u20132450, 2003.","journal-title":"IEEE Trans, Signal Processing"},{"key":"9063_CR6","volume-title":"Semidefinite Programming for Combinatorial Optimization","author":"C. Helmberg","year":"2000","unstructured":"C. Helmberg, Semidefinite Programming for Combinatorial Optimization, Konrad-Zuse-Zentrum fur informationstechnik:Berlin, Germany, 2000."},{"issue":"2","key":"9063_CR7","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C. Helmberg","year":"1996","unstructured":"C. Helmberg and F. Rendl, \u201cAn Interior-Point Method for Semidefinite Programming\u201d, SIAM J. Optim., Vol.6, No. 2, pp. 342\u2013361, 1996.","journal-title":"SIAM J. Optim"},{"key":"9063_CR8","volume-title":"Nonsmooth Optimization: Analysis and Algorithms with Application to Optimization Control","author":"M. Marko","year":"1992","unstructured":"M. Marko, Makeka, and Pekka Neittaanmaki, Nonsmooth Optimization: Analysis and Algorithms with Application to Optimization Control, World scientific:Singapore, 1992."},{"key":"9063_CR9","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goeman","year":"1995","unstructured":"M.X. Goeman and D.P. Williamson, \u201cImproved Approximation Algorithms for Maximum Cut and Satisfiably Problem Using Semidefinite Programming\u201d, Jour. of ACM, Vol. 42, pp. 1115\u20131145, 1995.","journal-title":"Jour. of ACM"},{"key":"9063_CR10","volume-title":"Technical Report, Courtant Institute of Math","author":"M.V. Nayakakuppam","year":"1997","unstructured":"M.V. Nayakakuppam, M.L. Overton, and S. Schemita, \u201cSDPpack User's Guide-Version 0.9 Beta\u201d, Technical Report, Courtant Institute of Math. Science, NYU, New York, 1997."}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-006-9063-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-006-9063-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-006-9063-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T09:04:18Z","timestamp":1559379858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-006-9063-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,13]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["9063"],"URL":"https:\/\/doi.org\/10.1007\/s11277-006-9063-4","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,13]]}}}