{"id":"https://openalex.org/W2922010963","doi":"https://doi.org/10.1109/codit.2019.8820584","title":"Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization","display_name":"Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2922010963","doi":"https://doi.org/10.1109/codit.2019.8820584","mag":"2922010963"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2019.8820584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2019.8820584","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1903.05390","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031948183","display_name":"Hadrien Godard","orcid":null},"institutions":[{"id":"https://openalex.org/I201181511","display_name":"\u00c9cole Nationale Sup\u00e9rieure de Techniques Avanc\u00e9es","ror":"https://ror.org/0309cs235","country_code":"FR","type":"education","lineage":["https://openalex.org/I201181511","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4210145724","display_name":"Centre d'\u00e9tudes et de recherche en informatique et communications","ror":"https://ror.org/044j5mm75","country_code":"FR","type":"facility","lineage":["https://openalex.org/I124158823","https://openalex.org/I4210134562","https://openalex.org/I4210145724"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hadrien Godard","raw_affiliation_strings":["UMA, ENSTA, Palaiseau, France","CEDRIC - OC, UMA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UMA, ENSTA, Palaiseau, France","institution_ids":["https://openalex.org/I201181511"]},{"raw_affiliation_string":"CEDRIC - OC, UMA","institution_ids":["https://openalex.org/I4210145724"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001951312","display_name":"Sourour Elloumi","orcid":"https://orcid.org/0000-0001-6289-7958"},"institutions":[{"id":"https://openalex.org/I201181511","display_name":"\u00c9cole Nationale Sup\u00e9rieure de Techniques Avanc\u00e9es","ror":"https://ror.org/0309cs235","country_code":"FR","type":"education","lineage":["https://openalex.org/I201181511","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4210145724","display_name":"Centre d'\u00e9tudes et de recherche en informatique et communications","ror":"https://ror.org/044j5mm75","country_code":"FR","type":"facility","lineage":["https://openalex.org/I124158823","https://openalex.org/I4210134562","https://openalex.org/I4210145724"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sourour Elloumi","raw_affiliation_strings":["UMA, ENSTA, Palaiseau, France","CEDRIC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UMA, ENSTA, Palaiseau, France","institution_ids":["https://openalex.org/I201181511"]},{"raw_affiliation_string":"CEDRIC","institution_ids":["https://openalex.org/I4210145724"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050885991","display_name":"Am\u00e9lie Lambert","orcid":"https://orcid.org/0000-0001-8305-2145"},"institutions":[{"id":"https://openalex.org/I124158823","display_name":"Conservatoire National des Arts et M\u00e9tiers","ror":"https://ror.org/0175hh227","country_code":"FR","type":"education","lineage":["https://openalex.org/I124158823","https://openalex.org/I4210134562"]},{"id":"https://openalex.org/I4210145724","display_name":"Centre d'\u00e9tudes et de recherche en informatique et communications","ror":"https://ror.org/044j5mm75","country_code":"FR","type":"facility","lineage":["https://openalex.org/I124158823","https://openalex.org/I4210134562","https://openalex.org/I4210145724"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Amelie Lambert","raw_affiliation_strings":["CEDRIC, CNAM, Paris, France","CEDRIC, CNAM, Paris, 75003, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CEDRIC, CNAM, Paris, France","institution_ids":["https://openalex.org/I124158823","https://openalex.org/I4210145724"]},{"raw_affiliation_string":"CEDRIC, CNAM, Paris, 75003, France","institution_ids":["https://openalex.org/I124158823","https://openalex.org/I4210145724"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009140930","display_name":"Jean Maeght","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jean Maeght","raw_affiliation_strings":["R&D Division, RTE (French TSO), France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"R&D Division, RTE (French TSO), France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105513989","display_name":"Manuel Ru\u00edz","orcid":"https://orcid.org/0000-0001-8153-276X"},"institutions":[{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Manuel Ruiz","raw_affiliation_strings":["R&D Division, RTE (French TSO), France","G-SCOP_OC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"R&D Division, RTE (French TSO), France","institution_ids":[]},{"raw_affiliation_string":"G-SCOP_OC","institution_ids":["https://openalex.org/I4210094718"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1227","last_page":"1232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10454","display_name":"Optimal Power Flow Distribution","score":0.9998000264167786,"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.9998000264167786,"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/T10305","display_name":"Power System Optimization and Stability","score":0.995199978351593,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9905999898910522,"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/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.7669638395309448},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7011412382125854},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6679216623306274},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.605338454246521},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5847480297088623},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5702338814735413},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.5502057075500488},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.5209982991218567},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47400960326194763},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4688393175601959},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4469534158706665},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41772329807281494},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.4170050621032715},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41444075107574463},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4110527038574219},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.31892478466033936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18758046627044678},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11364594101905823}],"concepts":[{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.7669638395309448},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7011412382125854},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6679216623306274},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.605338454246521},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5847480297088623},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5702338814735413},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.5502057075500488},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.5209982991218567},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47400960326194763},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4688393175601959},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4469534158706665},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41772329807281494},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.4170050621032715},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41444075107574463},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4110527038574219},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.31892478466033936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18758046627044678},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11364594101905823},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","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":5,"locations":[{"id":"doi:10.1109/codit.2019.8820584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2019.8820584","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1903.05390","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1903.05390","pdf_url":"https://arxiv.org/pdf/1903.05390","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-02065034v2","is_oa":false,"landing_page_url":"https://hal.science/hal-02065034","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"6th International Conference on Control, Decision and Information Technologies (CoDIT), Apr 2019, Paris, France. &#x27E8;10.1109/CoDIT.2019.8820584&#x27E9;","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.48550/arxiv.1903.05390","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1903.05390","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:2922010963","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1903.05390","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1903.05390","pdf_url":"https://arxiv.org/pdf/1903.05390","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W180478659","https://openalex.org/W872784446","https://openalex.org/W1970515840","https://openalex.org/W1978496689","https://openalex.org/W1988622494","https://openalex.org/W1996702873","https://openalex.org/W2001741445","https://openalex.org/W2004407575","https://openalex.org/W2039353469","https://openalex.org/W2093909370","https://openalex.org/W2106424475","https://openalex.org/W2141380252","https://openalex.org/W2142097077","https://openalex.org/W2201293300","https://openalex.org/W2294104245","https://openalex.org/W2510500307","https://openalex.org/W2553087624","https://openalex.org/W2741502759","https://openalex.org/W3101679863","https://openalex.org/W6675699470"],"related_works":["https://openalex.org/W2972119772","https://openalex.org/W2963978936","https://openalex.org/W2800992844","https://openalex.org/W872784446","https://openalex.org/W2374676786","https://openalex.org/W2741502759","https://openalex.org/W3119616506","https://openalex.org/W2965729731","https://openalex.org/W1571214415","https://openalex.org/W3042897778","https://openalex.org/W2352291778","https://openalex.org/W2346374866","https://openalex.org/W1859065560","https://openalex.org/W107346012","https://openalex.org/W2792900039","https://openalex.org/W2370179558","https://openalex.org/W2342459388","https://openalex.org/W2266995929","https://openalex.org/W2379843326","https://openalex.org/W2374790298"],"abstract_inverted_index":{"Optimal":[0],"Power":[1],"Flow":[2],"(OPF)":[3,52],"can":[4],"be":[5],"modeled":[6],"as":[7],"a":[8,40,46,93,100],"nonconvex":[9],"Quadratically":[10],"Constrained":[11],"Quadratic":[12,31],"Program":[13],"(QCQP).":[14],"Our":[15,162],"purpose":[16],"is":[17,39,53,78,90,116,124,137],"to":[18,21,36,65,80,139,155],"solve":[19],"OPF":[20,67,150],"global":[22],"optimality.":[23],"To":[24],"this":[25,61,88,146],"end,":[26],"we":[27],"specialize":[28],"the":[29,56,76,85,106,112,126,130,134,140,159],"Mixed-Integer":[30],"Convex":[32],"Reformulation":[33],"method":[34,41,147],"(MIQCR)":[35],"(OPF).":[37],"This":[38],"in":[42],"two":[43],"steps.":[44],"First,":[45],"Semi-Definite":[47],"Programming":[48],"(SDP)":[49],"relaxation":[50,62,104,142],"of":[51,60,105,121,133],"solved.":[54,117],"Then":[55],"optimal":[57],"dual":[58],"variables":[59],"are":[63,165],"used":[64],"reformulate":[66],"into":[68],"an":[69],"equivalent":[70],"new":[71],"quadratic":[72,101],"program,":[73],"where":[74,96],"all":[75],"non-convexity":[77],"moved":[79],"one":[81],"additional":[82],"constraint.":[83],"In":[84],"second":[86],"step,":[87],"reformulation":[89],"solved":[91],"within":[92],"branch-and-bound":[94,135],"algorithm,":[95],"at":[97,129],"each":[98],"node":[99,132],"and":[102],"convex":[103],"reformulated":[107],"problem,":[108],"obtained":[109],"by":[110],"relaxing":[111],"non-convex":[113],"added":[114],"constraint,":[115],"The":[118],"key":[119],"point":[120],"our":[122],"approach":[123],"that":[125],"lower":[127],"bound":[128],"root":[131],"tree":[136],"equal":[138],"SDP":[141],"value.":[143],"We":[144],"test":[145],"on":[148],"several":[149],"cases,":[151],"from":[152,158],"two-bus":[153],"networks":[154,157],"more-than-a-thousand-buses":[156],"MAT-POWER":[160],"repository.":[161],"first":[163],"results":[164],"very":[166],"encouraging.":[167]},"counts_by_year":[{"year":2022,"cited_by_count":2}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2022-07-24T00:00:00"}
