{"id":"https://openalex.org/W2050491901","doi":"https://doi.org/10.1137/08072320x","title":"Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization","display_name":"Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2050491901","doi":"https://doi.org/10.1137/08072320x","mag":"2050491901"},"language":"en","primary_location":{"id":"doi:10.1137/08072320x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/08072320x","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065686578","display_name":"Mikalai Kisialiou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mikalai Kisialiou","raw_affiliation_strings":["[email\u00a0protected] and [email\u00a0protected]#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[email\u00a0protected] and [email\u00a0protected]#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101766226","display_name":"Zhi\u2010Quan Luo","orcid":"https://orcid.org/0000-0003-3995-914X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhi-Quan Luo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3403,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.81264584,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"20","issue":"4","first_page":"1906","last_page":"1922"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8212143182754517},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7091509103775024},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5796874165534973},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5382182002067566},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5361284017562866},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5104738473892212},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.500309944152832},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.48100218176841736},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.4801144599914551},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.45366671681404114},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4477371275424957},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.44678983092308044},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.42354580760002136},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10792028903961182},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10269626975059509},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0904933512210846}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8212143182754517},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7091509103775024},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5796874165534973},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5382182002067566},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5361284017562866},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5104738473892212},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.500309944152832},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.48100218176841736},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.4801144599914551},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45366671681404114},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4477371275424957},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.44678983092308044},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.42354580760002136},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10792028903961182},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10269626975059509},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0904933512210846},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/08072320x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/08072320x","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1978666418","https://openalex.org/W1985123706","https://openalex.org/W1997002146","https://openalex.org/W2039953809","https://openalex.org/W2084661953","https://openalex.org/W2116394223","https://openalex.org/W2116631972","https://openalex.org/W2118388189","https://openalex.org/W2127995963","https://openalex.org/W2134376819","https://openalex.org/W2138293524","https://openalex.org/W2138358551","https://openalex.org/W2149094052","https://openalex.org/W2156816269","https://openalex.org/W2177435529"],"related_works":["https://openalex.org/W2352839224","https://openalex.org/W1989828432","https://openalex.org/W2371590971","https://openalex.org/W1653317167","https://openalex.org/W2203098598","https://openalex.org/W4293088966","https://openalex.org/W2024017812","https://openalex.org/W2917463375","https://openalex.org/W2366868484","https://openalex.org/W2377851227"],"abstract_inverted_index":{"We":[0,27],"consider":[1],"semidefinite":[2],"programming":[3],"relaxation":[4],"(SDR)":[5],"of":[6,21,32,39,77,102],"a":[7,37,68,73],"binary":[8,42],"quadratic":[9,43],"minimization":[10,44],"problem.":[11],"This":[12],"NP-hard":[13,56],"problem":[14,92],"arises":[15],"naturally":[16],"in":[17,65,82],"the":[18,29,33,47,78],"maximum-likelihood":[19],"detection":[20],"discrete":[22],"signals":[23],"for":[24,36,54],"digital":[25],"communications.":[26],"analyze":[28],"average":[30],"performance":[31],"SDR":[34,48,62],"algorithm":[35],"class":[38],"randomly":[40],"generated":[41],"problems.":[45],"Although":[46],"worst-case":[49],"approximation":[50,76],"ratio":[51],"is":[52,96],"unbounded":[53],"this":[55,85],"problem,":[57],"our":[58],"analysis":[59,101],"shows":[60],"that":[61],"can":[63],"provide":[64],"polynomial":[66],"time":[67],"provably":[69],"near-optimal":[70],"solution,":[71],"achieving":[72],"constant":[74,86],"factor":[75,87],"optimal":[79],"objective":[80],"value":[81],"probability.":[83],"Moreover,":[84],"remains":[88],"bounded":[89],"with":[90],"increasing":[91],"size.":[93],"Our":[94],"proof":[95],"based":[97],"on":[98],"an":[99],"asymptotic":[100],"Karush\u2013Kuhn\u2013Tucker":[103],"optimality":[104],"conditions":[105],"using":[106],"random":[107],"matrix":[108],"theory.":[109]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}