{"id":"https://openalex.org/W2100526385","doi":"https://doi.org/10.1109/camsap.2013.6714098","title":"Study of nonlinear power optimization problems using algebraic graph theory","display_name":"Study of nonlinear power optimization problems using algebraic graph theory","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2100526385","doi":"https://doi.org/10.1109/camsap.2013.6714098","mag":"2100526385"},"language":"en","primary_location":{"id":"doi:10.1109/camsap.2013.6714098","is_oa":false,"landing_page_url":"https://doi.org/10.1109/camsap.2013.6714098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 5th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5072786751","display_name":"Somayeh Sojoudi","orcid":"https://orcid.org/0000-0001-7177-7712"},"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":"Somayeh Sojoudi","raw_affiliation_strings":["Department of Computing and Mathematical Sciences, California Institute of Technology","Dept. of Comput. & Math. Sci., California Inst. of Technol., Pasadena, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing and Mathematical Sciences, California Institute of Technology","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"Dept. of Comput. & Math. Sci., California Inst. of Technol., Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042580848","display_name":"Javad Lavaei","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Javad Lavaei","raw_affiliation_strings":["Department of Electrical Engineering, Columbia University","Dept. of Electr. Eng, Columbia Univ., New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Columbia University","institution_ids":["https://openalex.org/I78577930"]},{"raw_affiliation_string":"Dept. of Electr. Eng, Columbia Univ., New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"424","last_page":"427"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10454","display_name":"Optimal Power Flow Distribution","score":0.9994999766349792,"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.9994999766349792,"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.9718000292778015,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9214000105857849,"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/mathematics","display_name":"Mathematics","score":0.6478915214538574},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5537706613540649},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49927568435668945},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.45987313985824585},{"id":"https://openalex.org/keywords/algebraic-graph-theory","display_name":"Algebraic graph theory","score":0.4442932605743408},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4412984251976013},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.41067641973495483},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36683911085128784},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3431914746761322},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.28828921914100647}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6478915214538574},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5537706613540649},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49927568435668945},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.45987313985824585},{"id":"https://openalex.org/C25799778","wikidata":"https://www.wikidata.org/wiki/Q4724003","display_name":"Algebraic graph theory","level":3,"score":0.4442932605743408},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4412984251976013},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.41067641973495483},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36683911085128784},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3431914746761322},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.28828921914100647},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/camsap.2013.6714098","is_oa":false,"landing_page_url":"https://doi.org/10.1109/camsap.2013.6714098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 5th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1606052501","https://openalex.org/W1964577612","https://openalex.org/W2062451421","https://openalex.org/W2122700623","https://openalex.org/W2141380252","https://openalex.org/W2145367961","https://openalex.org/W2158040846","https://openalex.org/W2159935945","https://openalex.org/W4250589301","https://openalex.org/W4297831800","https://openalex.org/W6681415697"],"related_works":["https://openalex.org/W4324118942","https://openalex.org/W2913057782","https://openalex.org/W2734993473","https://openalex.org/W2151484740","https://openalex.org/W4253768562","https://openalex.org/W2185064329","https://openalex.org/W2187229407","https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W3030201206"],"abstract_inverted_index":{"This":[0,60],"work":[1],"is":[2,33,43,83,94,130],"concerned":[3],"with":[4,30,45,115],"solving":[5],"non-convex":[6],"power":[7,141],"optimization":[8,16,29,56,70,103,138],"problems":[9,139],"by":[10],"introducing":[11],"the":[12,22,51,55,58,66,69,75,98,102,108,116,152],"concept":[13],"of":[14,24,54,68,79,101,110,119,126,137,154],"\u201cnonlinear":[15],"over":[17,140],"graph\u201d.":[18],"To":[19],"this":[20,127],"end,":[21],"structure":[23],"a":[25,36,46,134],"given":[26],"nonlinear":[27],"real/complex":[28],"quadratic":[31],"arguments":[32],"mapped":[34],"into":[35],"generalized":[37,61],"weighted":[38,62],"graph,":[39],"where":[40],"each":[41],"edge":[42],"associated":[44,112],"weight":[47,90,121],"set":[48],"constructed":[49],"from":[50,107],"known":[52],"parameters":[53],"(e.g.,":[57],"coefficients).":[59],"graph":[63,113],"captures":[64],"both":[65,86],"sparsity":[67],"and":[71,88,92],"possible":[72],"patterns":[73],"in":[74],"coefficients.":[76],"The":[77],"notion":[78],"\u201csign":[80],"definite":[81],"sets\u201d":[82],"introduced":[84],"for":[85],"real":[87],"complex":[89],"sets,":[91],"it":[93,129],"then":[95],"shown":[96],"that":[97,133],"polynomial-time":[99,144],"solvability":[100],"may":[104],"be":[105],"inferred":[106],"topology":[109],"its":[111,120],"together":[114],"sign":[117],"definiteness":[118],"sets.":[122],"As":[123],"an":[124],"application":[125],"result,":[128],"finally":[131],"proved":[132],"broad":[135],"class":[136],"networks":[142],"are":[143],"solvable":[145],"via":[146],"two":[147],"convex":[148],"relaxations":[149],"due":[150],"to":[151],"passivity":[153],"transmission":[155],"lines.":[156]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}