{"id":"https://openalex.org/W2886481884","doi":"https://doi.org/10.23919/acc.2018.8431203","title":"Combining SOS with Branch and Bound to Isolate Global Solutions of Polynomial Optimization Problems","display_name":"Combining SOS with Branch and Bound to Isolate Global Solutions of Polynomial Optimization Problems","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2886481884","doi":"https://doi.org/10.23919/acc.2018.8431203","mag":"2886481884"},"language":"en","primary_location":{"id":"doi:10.23919/acc.2018.8431203","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2018.8431203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Annual American Control Conference (ACC)","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/A5025576040","display_name":"Brendon K. Colbert","orcid":"https://orcid.org/0000-0003-1580-555X"},"institutions":[{"id":"https://openalex.org/I25217355","display_name":"University of Pavia","ror":"https://ror.org/00s6t1f81","country_code":"IT","type":"education","lineage":["https://openalex.org/I25217355"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Brendon Colbert","raw_affiliation_strings":["Dept. of Electrical, Computer and Biomedical Engineering, Universit\u00e1 degli Studi di Pavia, Pavia, Italy"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical, Computer and Biomedical Engineering, Universit\u00e1 degli Studi di Pavia, Pavia, Italy","institution_ids":["https://openalex.org/I25217355"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047399398","display_name":"Hesameddin Mohammadi","orcid":"https://orcid.org/0000-0003-3030-1536"},"institutions":[{"id":"https://openalex.org/I103320735","display_name":"Universit\u00e0 Cattolica del Sacro Cuore","ror":"https://ror.org/03h7r5v07","country_code":"IT","type":"education","lineage":["https://openalex.org/I103320735"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Hesameddin Mohammadi","raw_affiliation_strings":["Dept. of Mathematics and Physics, Universit\u00e1 Cattolica del Sacro Cuore, Brescia, Italy"],"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics and Physics, Universit\u00e1 Cattolica del Sacro Cuore, Brescia, Italy","institution_ids":["https://openalex.org/I103320735"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077552862","display_name":"Matthew M. Peet","orcid":"https://orcid.org/0000-0001-9360-6738"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthew M. Peet","raw_affiliation_strings":["IAFSE-SEMTE: Mechanical and Aerospace Engineering"],"affiliations":[{"raw_affiliation_string":"IAFSE-SEMTE: Mechanical and Aerospace Engineering","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025576040"],"corresponding_institution_ids":["https://openalex.org/I25217355"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12695445,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2190","last_page":"2197"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9987999796867371,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9818000197410583,"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/bounded-function","display_name":"Bounded function","score":0.6274451017379761},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.6072590351104736},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5911581516265869},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5576211214065552},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5222017168998718},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5194222927093506},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.515958845615387},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5004303455352783},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4960957467556},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.48286134004592896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4731619954109192},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.46730729937553406},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4642425775527954},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.4411375820636749},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32645973563194275},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.061072736978530884}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6274451017379761},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.6072590351104736},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5911581516265869},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5576211214065552},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5222017168998718},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5194222927093506},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.515958845615387},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5004303455352783},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4960957467556},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.48286134004592896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4731619954109192},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.46730729937553406},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4642425775527954},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.4411375820636749},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32645973563194275},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.061072736978530884},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"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},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc.2018.8431203","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2018.8431203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Annual American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W217710249","https://openalex.org/W1559197676","https://openalex.org/W1698110770","https://openalex.org/W1964603869","https://openalex.org/W1996541174","https://openalex.org/W2000825868","https://openalex.org/W2015089195","https://openalex.org/W2033040247","https://openalex.org/W2054589207","https://openalex.org/W2058772914","https://openalex.org/W2067100964","https://openalex.org/W2079258636","https://openalex.org/W2083449425","https://openalex.org/W2085352155","https://openalex.org/W2106850246","https://openalex.org/W2118807841","https://openalex.org/W2133404041","https://openalex.org/W2156825077","https://openalex.org/W2165281529","https://openalex.org/W2498144272","https://openalex.org/W2611147814","https://openalex.org/W2963203019"],"related_works":["https://openalex.org/W2088448568","https://openalex.org/W4299455866","https://openalex.org/W2995097707","https://openalex.org/W2046515352","https://openalex.org/W3034393045","https://openalex.org/W2031345939","https://openalex.org/W2007827522","https://openalex.org/W1603259840","https://openalex.org/W3151690733","https://openalex.org/W3123386130"],"abstract_inverted_index":{"In":[0],"this":[1,106,139],"paper,":[2],"we":[3,74],"combine":[4],"a":[5,60,81,142],"branch":[6],"and":[7,55,149],"bound":[8],"algorithm":[9,49,78,110,154],"with":[10,26,92,145],"SOS":[11,57],"programming":[12],"in":[13],"order":[14],"to":[15,20,42,58],"obtain":[16,43],"arbitrarily":[17,31],"accurate":[18,32,130],"solutions":[19,33],"Global":[21],"Polynomial":[22],"Optimization":[23],"(GPO)":[24],"problems":[25],"bounded":[27],"feasible":[28,53,67],"sets.":[29],"These":[30],"are":[34],"then":[35,125],"fed":[36],"into":[37],"local":[38,147],"gradient":[39,134],"descent":[40,135],"algorithms":[41],"the":[44,52,77,101,109,152,157],"true":[45],"global":[46,102,161],"optimizer.":[47,103],"The":[48,121],"successively":[50],"bisects":[51],"set":[54],"uses":[56],"compute":[59],"Greatest":[61],"Lower":[62],"Bound":[63],"(GLB)":[64],"over":[65],"each":[66,116],"set.":[68],"For":[69],"any":[70],"desired":[71],"accuracy,":[72],"\u03b5,":[73],"prove":[75],"that":[76,85,151],"will":[79],"return":[80],"point":[82,91,122],"x":[83],"such":[84],"|x-y|":[86],"\u2264":[87,96],"\u03b5":[88,97],"for":[89,133],"some":[90],"objective":[93],"value":[94,132],"|f(y)-f(x*)|":[95],"where":[98],"x*":[99],"is":[100],"To":[104],"achieve":[105],"point,":[107],"x,":[108,123],"sequentially":[111],"solves":[112],"O(log(1/\u03b5))":[113],"GLB":[114],"problems,":[115],"of":[117,159],"identical":[118],"polynomial-time":[119],"complexity.":[120],"can":[124],"be":[126],"used":[127],"as":[128],"an":[129],"initial":[131],"algorithms.":[136],"We":[137],"illustrate":[138],"approach":[140],"using":[141],"numerical":[143],"example":[144],"several":[146],"optima":[148],"demonstrate":[150],"proposed":[153],"dramatically":[155],"increases":[156],"effectiveness":[158],"standard":[160],"optimization":[162],"solvers.":[163]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}