{"id":"https://openalex.org/W2551881024","doi":null,"title":"New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems","display_name":"New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems","publication_year":2011,"publication_date":"2011-08-26","ids":{"openalex":"https://openalex.org/W2551881024","mag":"2551881024"},"language":"en","primary_location":{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/6139","doi":null,"is_oa":false,"landing_page_url":"https://uwspace.uwaterloo.ca/bitstreams/d2d2b294-ec67-415b-b3f3-d26a15ae8889/download","pdf_url":null,"source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Doctoral Thesis"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"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/A5084563518","display_name":"Bissan Ghaddar","orcid":"https://orcid.org/0000-0003-4695-200X","observed_orcids":["https://orcid.org/0000-0003-4695-200X"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bissan Ghaddar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5084563518"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"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":1.0,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0,"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/polynomial-programming","display_name":"polynomial programming","score":0.8159999847412109},{"id":"https://openalex.org/keywords/conic-relaxation","display_name":"conic relaxation","score":0.8360000252723694},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"second-order cone programming","score":0.8410000205039978},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"semidefinite programming","score":0.9800000190734863},{"id":"https://openalex.org/keywords/polynomial-inequalities","display_name":"polynomial inequalities","score":0.7160000205039978},{"id":"https://openalex.org/keywords/global-optimization","display_name":"global optimization","score":0.6940000057220459},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.8889999985694885},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7630000114440918}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6558090448379517},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.627297043800354},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5925774574279785},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.526095986366272},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.5032328963279724},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4986882209777832},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4641004800796509},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.4610743522644043},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4528220593929291},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4403933584690094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4226682186126709},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40887248516082764},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.34774452447891235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33697232604026794},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.10193276405334473},{"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/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/6139","doi":null,"is_oa":false,"landing_page_url":"https://uwspace.uwaterloo.ca/bitstreams/d2d2b294-ec67-415b-b3f3-d26a15ae8889/download","pdf_url":null,"source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Doctoral Thesis"},{"id":"mag:2551881024","doi":null,"is_oa":false,"landing_page_url":"https://uwspace.uwaterloo.ca/bitstream/10012/6139/1/Ghaddar_Bissan.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":86,"referenced_works":["https://openalex.org/W1489384219","https://openalex.org/W1503085769","https://openalex.org/W1509338356","https://openalex.org/W1518832340","https://openalex.org/W1522995151","https://openalex.org/W1525062912","https://openalex.org/W1535868076","https://openalex.org/W1563737017","https://openalex.org/W1568307856","https://openalex.org/W1595903022","https://openalex.org/W1606052501","https://openalex.org/W1965094948","https://openalex.org/W1967073510","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1970193303","https://openalex.org/W1970801029","https://openalex.org/W1971164758","https://openalex.org/W1981081845","https://openalex.org/W1985123706","https://openalex.org/W1986591158","https://openalex.org/W1989190791","https://openalex.org/W1992008263","https://openalex.org/W1994932713","https://openalex.org/W1997672673","https://openalex.org/W1999613943","https://openalex.org/W2001033871","https://openalex.org/W2002576503","https://openalex.org/W2004229681","https://openalex.org/W2009923109","https://openalex.org/W2011039300","https://openalex.org/W2013603106","https://openalex.org/W2019886197","https://openalex.org/W2030613721","https://openalex.org/W2030686911","https://openalex.org/W2035949967","https://openalex.org/W2036566088","https://openalex.org/W2037417853","https://openalex.org/W2043677016","https://openalex.org/W2049087128","https://openalex.org/W2049143039","https://openalex.org/W2051306216","https://openalex.org/W2055993677","https://openalex.org/W2057162710","https://openalex.org/W2057595593","https://openalex.org/W2060252799","https://openalex.org/W2064915245","https://openalex.org/W2074078071","https://openalex.org/W2074448783","https://openalex.org/W2074859470","https://openalex.org/W2077397558","https://openalex.org/W2079135578","https://openalex.org/W2082782506","https://openalex.org/W2084148362","https://openalex.org/W2084512390","https://openalex.org/W2085045434","https://openalex.org/W2087999447","https://openalex.org/W2091364465","https://openalex.org/W2094995801","https://openalex.org/W2100440346","https://openalex.org/W2105235982","https://openalex.org/W2105318109","https://openalex.org/W2106264302","https://openalex.org/W2110540077","https://openalex.org/W2114467398","https://openalex.org/W2114650657","https://openalex.org/W2120146316","https://openalex.org/W2120583150","https://openalex.org/W2122604873","https://openalex.org/W2124038748","https://openalex.org/W2132400628","https://openalex.org/W2133404041","https://openalex.org/W2133602590","https://openalex.org/W2138322123","https://openalex.org/W2140214428","https://openalex.org/W2144931885","https://openalex.org/W2159739530","https://openalex.org/W2162579105","https://openalex.org/W2166798101","https://openalex.org/W2170832344","https://openalex.org/W2188609405","https://openalex.org/W2250294758","https://openalex.org/W2495457432","https://openalex.org/W2498144272","https://openalex.org/W2912522929","https://openalex.org/W3145564876"],"related_works":["https://openalex.org/W2059380806","https://openalex.org/W1576720100","https://openalex.org/W4312202296","https://openalex.org/W1988815259","https://openalex.org/W7210232056","https://openalex.org/W3107186052","https://openalex.org/W2912855296","https://openalex.org/W4304974346","https://openalex.org/W2136414169","https://openalex.org/W4319989288"],"abstract_inverted_index":{"Polynomial":[0,27],"programming,":[1,185,212],"a":[2,30,46,139,187,241,362],"class":[3],"of":[4,20,44,49,55,93,102,129,133,197,226,234,273,285,322,342],"non-linear":[5],"programming":[6,28],"where":[7],"the":[8,11,18,24,41,53,76,94,215,222,238,263,271,274,286,320,326,331,339,343,352,358],"objective":[9],"and":[10,71,124,159,183,308],"constraints":[12],"are":[13,68,80,86,97,127,173,219,355],"multivariate":[14],"polynomials,":[15],"has":[16],"attracted":[17],"attention":[19],"many":[21],"researchers":[22],"in":[23,75,113,221,224,232,270,310,361],"past":[25],"decade.":[26],"is":[29,52,206,255,291,302,309],"powerful":[31],"modeling":[32],"tool":[33],"that":[34,126,218],"captures":[35],"various":[36],"optimization":[37,317],"models.":[38],"Due":[39],"to":[40,105,142,154,246,313,330,365],"wide":[42],"range":[43],"applications,":[45],"research":[47],"topic":[48],"high":[50],"interest":[51],"development":[54],"computationally":[56,117],"efficient":[57],"algorithms":[58],"for":[59,88,146,168,194,251,304,348],"solving":[60,130],"polynomial":[61,90,107,131,148,171,201,249,253,287,306,324,345,350],"programs.":[62,91],"Even":[63],"though":[64],"some":[65],"solution":[66,334],"methodologies":[67],"already":[69],"available":[70,95],"have":[72],"been":[73],"studied":[74],"literature,":[77],"these":[78,109],"approaches":[79],"often":[81],"either":[82],"problem":[83],"specific":[84],"or":[85,295],"inapplicable":[87],"large-scale":[89],"Most":[92],"methods":[96,123],"based":[98,179,207,294,297],"on":[99,180,209,281,338],"using":[100],"hierarchies":[101],"convex":[103],"relaxations":[104,145,167,193,217,239,354],"solve":[106],"programs;":[108],"schemes":[110,158],"grow":[111],"exponentially":[112],"size":[114,272],"becoming":[115],"rapidly":[116],"expensive.":[118],"The":[119,175,203,276,299],"present":[120],"work":[121],"proposes":[122],"implementations":[125],"capable":[128],"programs":[132,172,254,307,351],"large":[134,314],"sizes.":[135],"First":[136],"we":[137],"propose":[138],"general":[140,252,315],"framework":[141,151],"construct":[143],"conic":[144],"binary":[147,169,199,305,323,344,349],"programs,":[149,325],"this":[150,260],"allows":[152],"us":[153],"re-derive":[155],"previous":[156,191],"relaxation":[157,205,284],"provide":[160],"new":[161,166],"ones.":[162],"In":[163,319],"particular,":[164],"three":[165],"quadratic":[170,200],"presented.":[174,256],"first":[176],"two":[177],"relaxations,":[178],"second-order":[181,210,292],"cone":[182,211,293],"semidefinite":[184,296],"represent":[186],"significant":[188],"improvement":[189],"over":[190],"practical":[192],"several":[195],"classes":[196],"non-convex":[198],"problems.":[202,318],"third":[204],"purely":[208],"it":[213,290],"outperforms":[214],"semidefinite-based":[216],"proposed":[220,300,327,353],"literature":[223],"terms":[225,233],"computational":[227],"efficiency":[228],"while":[229],"being":[230],"comparable":[231],"bounds.":[235],"To":[236],"strengthen":[237],"further,":[240],"dynamic":[242,359],"inequality":[243],"generation":[244],"scheme":[245,261,277,301,328,360],"generate":[247],"valid":[248],"inequalities":[250],"When":[257],"used":[258,280],"iteratively,":[259],"improves":[262],"bounds":[264],"without":[265],"incurring":[266],"an":[267],"exponential":[268],"growth":[269],"relaxation.":[275],"can":[278],"be":[279],"any":[282],"initial":[283,340],"program":[288],"whether":[289],"relaxations.":[298],"specialized":[303],"principle":[311],"scalable":[312],"combinatorial":[316],"case":[321],"converges":[329],"global":[332,367],"optimal":[333,368],"under":[335],"mild":[336],"assumptions":[337],"approximation":[341],"program.":[346],"Finally,":[347],"integrated":[356],"with":[357],"branch-and-bound":[363],"algorithm":[364],"find":[366],"solutions.":[369]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-11-30T00:00:00"}