{"id":"https://openalex.org/W3120252328","doi":"https://doi.org/10.1109/cdc42340.2020.9303921","title":"Convex model to evaluate worst-case performance of local search in the Optimal Power Flow problem","display_name":"Convex model to evaluate worst-case performance of local search in the Optimal Power Flow problem","publication_year":2020,"publication_date":"2020-12-14","ids":{"openalex":"https://openalex.org/W3120252328","doi":"https://doi.org/10.1109/cdc42340.2020.9303921","mag":"3120252328"},"language":"en","primary_location":{"id":"doi:10.1109/cdc42340.2020.9303921","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc42340.2020.9303921","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 59th IEEE Conference on Decision and Control (CDC)","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/A5064659500","display_name":"Elizabeth Glista","orcid":"https://orcid.org/0000-0003-2870-3659"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Elizabeth Glista","raw_affiliation_strings":["University of California, Berkeley"],"affiliations":[{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072786751","display_name":"Somayeh Sojoudi","orcid":"https://orcid.org/0000-0001-7177-7712"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Somayeh Sojoudi","raw_affiliation_strings":["University of California, Berkeley"],"affiliations":[{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064659500"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15100041,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1691","last_page":"1697"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10454","display_name":"Optimal Power Flow Distribution","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10454","display_name":"Optimal Power Flow Distribution","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.991599977016449,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9736999869346619,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.853156566619873},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7824140191078186},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.7453616261482239},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6620233654975891},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6236318349838257},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49974989891052246},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4843645989894867},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48409759998321533},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.481481671333313},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4512360692024231},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4247277081012726},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41770821809768677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40970829129219055},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.3144940733909607},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17462241649627686}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.853156566619873},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7824140191078186},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.7453616261482239},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6620233654975891},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6236318349838257},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49974989891052246},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4843645989894867},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48409759998321533},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.481481671333313},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4512360692024231},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4247277081012726},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41770821809768677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40970829129219055},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.3144940733909607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17462241649627686},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc42340.2020.9303921","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc42340.2020.9303921","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 59th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W217710249","https://openalex.org/W1965408066","https://openalex.org/W1968878112","https://openalex.org/W1993600232","https://openalex.org/W2039353469","https://openalex.org/W2057057063","https://openalex.org/W2085523940","https://openalex.org/W2086664392","https://openalex.org/W2104106131","https://openalex.org/W2122700623","https://openalex.org/W2133919892","https://openalex.org/W2141380252","https://openalex.org/W2327238720","https://openalex.org/W2558998826","https://openalex.org/W2608272796","https://openalex.org/W3045821652","https://openalex.org/W3106117336","https://openalex.org/W4254315244","https://openalex.org/W6781455059","https://openalex.org/W6786522596"],"related_works":["https://openalex.org/W4293088966","https://openalex.org/W2112847829","https://openalex.org/W1878408459","https://openalex.org/W4297407962","https://openalex.org/W2022619808","https://openalex.org/W2917463375","https://openalex.org/W2808715032","https://openalex.org/W1496670269","https://openalex.org/W2064249866","https://openalex.org/W2108152589"],"abstract_inverted_index":{"The":[0,72],"optimal":[1,37],"power":[2,20,29],"flow":[3],"(OPF)":[4],"problem":[5,11,97,109,134,197],"is":[6,77,120,144],"a":[7,69,99,130,136,207],"well-known":[8],"non-convex":[9,57,121],"optimization":[10],"that":[12,142],"aims":[13],"to":[14,23,39,55,66,78,124,156,169,184,198],"minimize":[15],"the":[16,26,56,60,80,87,95,108,112,163,166,171,177,185,190,195],"cost":[17],"of":[18,28,59,74,83,110,116,132,165,194],"electric":[19],"generation":[21],"subject":[22],"consumer":[24],"demand,":[25],"physics":[27],"flow,":[30],"and":[31,122,140],"technological":[32],"constraints.":[33],"To":[34,90],"find":[35,129],"an":[36],"solution":[38],"this":[40,75,117,133],"problem,":[41,61],"local":[42,84,114,159,173,182,204],"search":[43,85,205],"techniques":[44],"such":[45],"as":[46,98],"interior":[47],"point":[48],"methods":[49,63],"are":[50,64,154],"typically":[51],"used.":[52],"However,":[53],"due":[54],"nature":[58],"these":[62],"likely":[65],"result":[67],"in":[68,126],"sub-optimal":[70],"solution.":[71],"goal":[73],"paper":[76],"characterize":[79],"worst-case":[81,113,172],"performance":[82],"on":[86,181],"OPF":[88,96,196],"problem.":[89,209],"accomplish":[91],"this,":[92],"we":[93,106,161],"formulate":[94],"canonical":[100],"quadratically-constrained":[101],"quadratic":[102],"program":[103,138],"(QCQP).":[104],"Then,":[105],"study":[107],"finding":[111],"minimum":[115],"QCQP,":[118],"which":[119,153],"hard":[123],"solve":[125],"general.":[127],"We":[128,175],"relaxation":[131,168,193],"into":[135],"semidefinite":[137],"(SDP)":[139],"show":[141],"it":[143],"exact":[145],"for":[146,206],"certain":[147],"cases.":[148],"Using":[149],"some":[150],"test":[151],"cases":[152],"known":[155],"have":[157],"multiple":[158],"minima,":[160],"demonstrate":[162],"effectiveness":[164],"proposed":[167],"bound":[170,180,187],"minimum.":[174],"compare":[176],"obtained":[178],"upper":[179],"minima":[183],"lower":[186],"provided":[188],"by":[189],"standard":[191],"SDP":[192,202],"understand":[199],"how":[200],"much":[201],"outperforms":[203],"given":[208]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}