{"id":"https://openalex.org/W1970199776","doi":"https://doi.org/10.1109/smartgridcomm.2014.7007744","title":"A non-convex alternating direction method of multipliers heuristic for optimal power flow","display_name":"A non-convex alternating direction method of multipliers heuristic for optimal power flow","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W1970199776","doi":"https://doi.org/10.1109/smartgridcomm.2014.7007744","mag":"1970199776"},"language":"en","primary_location":{"id":"doi:10.1109/smartgridcomm.2014.7007744","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smartgridcomm.2014.7007744","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Smart Grid Communications (SmartGridComm)","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/A5020586433","display_name":"Seungil You","orcid":"https://orcid.org/0000-0002-1984-9077"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Seungil You","raw_affiliation_strings":["California Institute of Technology","California  Institute of Technology"],"affiliations":[{"raw_affiliation_string":"California Institute of Technology","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"California  Institute of Technology","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010101226","display_name":"Qiuyu Peng","orcid":null},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qiuyu Peng","raw_affiliation_strings":["California Institute of Technology","California  Institute of Technology"],"affiliations":[{"raw_affiliation_string":"California Institute of Technology","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"California  Institute of Technology","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020586433"],"corresponding_institution_ids":["https://openalex.org/I122411786"],"apc_list":null,"apc_paid":null,"fwci":2.5486,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.90240823,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"788","last_page":"793"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10454","display_name":"Optimal Power Flow Distribution","score":0.9990000128746033,"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.9990000128746033,"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.9937000274658203,"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.9501000046730042,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7444876432418823},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5735654830932617},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5599342584609985},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5320098400115967},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.5068965554237366},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.49094799160957336},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.4863472580909729},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4740547835826874},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4627649188041687},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.41475069522857666},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35998421907424927}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7444876432418823},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5735654830932617},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5599342584609985},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5320098400115967},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.5068965554237366},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.49094799160957336},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.4863472580909729},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4740547835826874},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4627649188041687},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.41475069522857666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35998421907424927},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/smartgridcomm.2014.7007744","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smartgridcomm.2014.7007744","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Smart Grid Communications (SmartGridComm)","raw_type":"proceedings-article"},{"id":"pmh:oai:authors.library.caltech.edu:53872","is_oa":false,"landing_page_url":"https://authors.library.caltech.edu/53872/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402161","display_name":"CaltechAUTHORS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Section"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1968878112","https://openalex.org/W1990975970","https://openalex.org/W1995874947","https://openalex.org/W1996702873","https://openalex.org/W1998764943","https://openalex.org/W1999913571","https://openalex.org/W2011393317","https://openalex.org/W2053254868","https://openalex.org/W2086664392","https://openalex.org/W2089566559","https://openalex.org/W2093909370","https://openalex.org/W2100197017","https://openalex.org/W2104106131","https://openalex.org/W2109375302","https://openalex.org/W2128166312","https://openalex.org/W2141380252","https://openalex.org/W2159935945","https://openalex.org/W2164278908","https://openalex.org/W2170736358","https://openalex.org/W2327238720","https://openalex.org/W2536620281","https://openalex.org/W2553087624","https://openalex.org/W2944753221","https://openalex.org/W3097981256","https://openalex.org/W3098546508","https://openalex.org/W4249837196","https://openalex.org/W4292363360","https://openalex.org/W4297831800","https://openalex.org/W4403138824","https://openalex.org/W6678926812"],"related_works":["https://openalex.org/W4312206320","https://openalex.org/W4384575246","https://openalex.org/W2160052563","https://openalex.org/W2952841129","https://openalex.org/W2115832833","https://openalex.org/W2803118069","https://openalex.org/W2126408684","https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W4285101096"],"abstract_inverted_index":{"The":[0],"optimal":[1],"power":[2,9],"flow":[3],"(OPF)":[4],"problem":[5,19],"is":[6,15,68,136],"fundamental":[7],"to":[8,39,56,70],"system":[10],"planing":[11],"and":[12,20,84],"operation.":[13],"It":[14],"a":[16,58,80,85,103,118,122,144],"non-convex":[17,86,109],"optimization":[18,82,87,110],"the":[21,31,40,49,62,65,71,75,89,94,98,108,113,127,131,134],"semidefinite":[22],"programming":[23],"(SDP)":[24],"relaxation":[25,33,67],"has":[26],"been":[27],"proposed":[28,76],"recently.":[29],"However,":[30],"SDP":[32,66],"may":[34],"give":[35],"an":[36],"infeasible":[37,69],"solution":[38,60,63,106,146],"original":[41],"OPF":[42,72,128],"problem.":[43,73,129],"In":[44],"this":[45],"paper,":[46],"we":[47,101,120],"apply":[48],"alternating":[50],"direction":[51],"method":[52,55],"of":[53,64,97,107,133],"multiplier":[54],"recover":[57],"feasible":[59,145],"when":[61],"Specifically,":[74],"procedure":[77],"iterates":[78],"between":[79],"convex":[81],"problem,":[83],"with":[88],"rank":[90,99],"constraint.":[91],"By":[92],"exploiting":[93],"special":[95],"structure":[96],"constraint,":[100],"obtain":[102,121],"closed":[104],"form":[105],"based":[111],"on":[112],"singular":[114],"value":[115],"decomposition.":[116],"As":[117],"result,":[119],"computationally":[123],"tractable":[124],"heuristic":[125],"for":[126],"Although":[130],"convergence":[132],"algorithm":[135],"not":[137],"theoretically":[138],"guaranteed,":[139],"our":[140,151],"simulations":[141],"show":[142],"that":[143],"can":[147],"be":[148],"recovered":[149],"using":[150],"method.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}