{"id":"https://openalex.org/W2098101867","doi":"https://doi.org/10.1109/icassp.2003.1201783","title":"Approximate maximum-likelihood estimation using semidefinite programming","display_name":"Approximate maximum-likelihood estimation using semidefinite programming","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2098101867","doi":"https://doi.org/10.1109/icassp.2003.1201783","mag":"2098101867"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2003.1201783","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2003.1201783","pdf_url":null,"source":{"id":"https://openalex.org/S4363608982","display_name":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","raw_type":"proceedings-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/A5014398090","display_name":"Joachim Dahl","orcid":"https://orcid.org/0000-0002-5656-7909"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"J. Dahl","raw_affiliation_strings":["Department of Communication Technology, University of Aalborg, Aalborg, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communication Technology, University of Aalborg, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064657299","display_name":"Bernard H. Fleury","orcid":"https://orcid.org/0000-0002-9061-3083"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"B.H. Fleury","raw_affiliation_strings":["Department of Communication Technology, University of Aalborg, Aalborg, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communication Technology, University of Aalborg, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017990990","display_name":"Lieven Vandenberghe","orcid":"https://orcid.org/0000-0003-4153-2268"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"L. Vandenberghe","raw_affiliation_strings":["Department of Electrical Engineering, University of California, Los Angeles, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2131,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86363636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"VI","last_page":"721"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9969000220298767,"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/T10142","display_name":"Formal Methods in Verification","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.8517616987228394},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.7114267945289612},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.6995136737823486},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6502525806427002},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6127094030380249},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5604593753814697},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5582470297813416},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.516339898109436},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5022497177124023},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4647718071937561},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.46031779050827026},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.42241132259368896},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4113417863845825},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3144424557685852},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.27807700634002686}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8517616987228394},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.7114267945289612},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.6995136737823486},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6502525806427002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6127094030380249},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5604593753814697},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5582470297813416},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.516339898109436},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5022497177124023},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4647718071937561},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46031779050827026},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.42241132259368896},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4113417863845825},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3144424557685852},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.27807700634002686},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icassp.2003.1201783","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2003.1201783","pdf_url":null,"source":{"id":"https://openalex.org/S4363608982","display_name":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/14274c30-9c2e-11db-8ed6-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/14274c30-9c2e-11db-8ed6-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dahl, J, Vandenberghe, L & Fleury, B H 2003, Approximate maximum-likelihood estimation using semidefinite programming. in ICASSP Proceedings, April, 2003. IEEE Press, pp. 721-724, Approximate maximum-likelihood estimation using semidefinite programming, 19/05/2010.","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1985123706","https://openalex.org/W2045148236","https://openalex.org/W2057950931","https://openalex.org/W2129429798","https://openalex.org/W2134376819","https://openalex.org/W2296319761","https://openalex.org/W2798333393","https://openalex.org/W2912369344","https://openalex.org/W3122023393","https://openalex.org/W4248676392","https://openalex.org/W6662028256","https://openalex.org/W6679439748"],"related_works":["https://openalex.org/W2348903644","https://openalex.org/W2975050997","https://openalex.org/W2737505353","https://openalex.org/W2912522929","https://openalex.org/W1653317167","https://openalex.org/W1989828432","https://openalex.org/W2364528045","https://openalex.org/W2352839224","https://openalex.org/W2385886188","https://openalex.org/W2098101867"],"abstract_inverted_index":{"We":[0,55,82],"consider":[1],"semidefinite":[2,73,97],"relaxations":[3,74,91,134],"of":[4,16,75,79,110,131],"a":[5,39,67,76],"quadratic":[6,17,50],"optimization":[7],"problem":[8],"with":[9,19,135],"polynomial":[10,31,53,68],"constraints.":[11],"This":[12],"is":[13],"an":[14],"extension":[15],"problems":[18,24,51],"Boolean":[20,49,60,80],"variables.":[21,81],"Such":[22],"combinatorial":[23],"cannot,":[25],"in":[26,30,52,117,123,125],"general,":[27],"be":[28,94,101],"solved":[29,102],"time.":[32,54],"Semidefinite":[33],"relaxation":[34,69,87],"has":[35],"been":[36],"proposed":[37],"as":[38,96],"promising":[40],"technique":[41],"to":[42,62,127],"give":[43],"provable":[44],"good":[45],"bounds":[46],"on":[47],"certain":[48],"formulate":[56],"the":[57,84,129,132],"extensions":[58],"from":[59],"variables":[61,64],"quarternary":[63],"using":[65,104],"(i)":[66],"or":[70],"(ii)":[71],"standard":[72],"linear":[77],"transformation":[78],"compare":[83,128],"two":[85],"different":[86,133],"approaches":[88],"analytically.":[89],"The":[90],"can":[92,100],"all":[93],"expressed":[95],"programs,":[98],"which":[99,120],"efficiently":[103],"e.g.":[105],"interior":[106],"point":[107],"methods.":[108],"Applications":[109],"our":[111],"results":[112],"include":[113],"maximum":[114],"likelihood":[115],"estimation":[116],"communication":[118],"systems,":[119],"we":[121],"explore":[122],"simulations":[124],"order":[126],"quality":[130],"optimal":[136],"solutions.":[137]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}