{"id":"https://openalex.org/W2492779023","doi":"https://doi.org/10.1080/10556788.2016.1213839","title":"Distributed primal\u2013dual interior-point methods for solving tree-structured coupled convex problems using message-passing","display_name":"Distributed primal\u2013dual interior-point methods for solving tree-structured coupled convex problems using message-passing","publication_year":2016,"publication_date":"2016-08-05","ids":{"openalex":"https://openalex.org/W2492779023","doi":"https://doi.org/10.1080/10556788.2016.1213839","mag":"2492779023"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2016.1213839","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1213839","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-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/A5008205310","display_name":"Sina Khoshfetrat Pakazad","orcid":"https://orcid.org/0000-0002-0263-2410"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Sina Khoshfetrat Pakazad","raw_affiliation_strings":["Division of Automatic Control, Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Automatic Control, Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113604613","display_name":"Anders Hansson","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Anders Hansson","raw_affiliation_strings":["Division of Automatic Control, Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Automatic Control, Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005503523","display_name":"Martin S. Andersen","orcid":"https://orcid.org/0000-0002-4654-3946"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Martin S. Andersen","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science, Technical University of Denmark, Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science, Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082723326","display_name":"Isak Nielsen","orcid":"https://orcid.org/0000-0002-1102-1849"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Isak Nielsen","raw_affiliation_strings":["Division of Automatic Control, Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Automatic Control, Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008205310"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":8.1057,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.97957921,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"32","issue":"3","first_page":"401","last_page":"435"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994999766349792,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9976000189781189,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9951000213623047,"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/interior-point-method","display_name":"Interior point method","score":0.6366285085678101},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.60639488697052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5554863214492798},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5389446020126343},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5250667929649353},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.511520266532898},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5105774998664856},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4814383387565613},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.4646878242492676},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.46315187215805054},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4579763114452362},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4295387268066406},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.09517011046409607},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09240064024925232}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.6366285085678101},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.60639488697052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5554863214492798},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5389446020126343},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5250667929649353},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.511520266532898},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5105774998664856},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4814383387565613},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.4646878242492676},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.46315187215805054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4579763114452362},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4295387268066406},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.09517011046409607},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09240064024925232},{"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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2016.1213839","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1213839","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W1511986666","https://openalex.org/W1513869646","https://openalex.org/W1518039036","https://openalex.org/W1519035328","https://openalex.org/W1525779601","https://openalex.org/W1553090000","https://openalex.org/W1574923065","https://openalex.org/W1600499793","https://openalex.org/W1603765807","https://openalex.org/W1616065164","https://openalex.org/W1874715488","https://openalex.org/W1946620893","https://openalex.org/W1974059941","https://openalex.org/W1989165177","https://openalex.org/W1991482609","https://openalex.org/W1992947101","https://openalex.org/W2010286849","https://openalex.org/W2014261141","https://openalex.org/W2014495508","https://openalex.org/W2015563522","https://openalex.org/W2030828780","https://openalex.org/W2031990962","https://openalex.org/W2032395696","https://openalex.org/W2035233604","https://openalex.org/W2044212084","https://openalex.org/W2044265095","https://openalex.org/W2046189742","https://openalex.org/W2053764342","https://openalex.org/W2055916047","https://openalex.org/W2063675347","https://openalex.org/W2076261573","https://openalex.org/W2084601546","https://openalex.org/W2098432798","https://openalex.org/W2108619558","https://openalex.org/W2114791779","https://openalex.org/W2133429056","https://openalex.org/W2156094048","https://openalex.org/W2164278908","https://openalex.org/W2186600482","https://openalex.org/W2296319761","https://openalex.org/W2536620281","https://openalex.org/W2748746471","https://openalex.org/W2951449769","https://openalex.org/W2963062431","https://openalex.org/W3106327698","https://openalex.org/W3119976028","https://openalex.org/W3145128584","https://openalex.org/W4250589301","https://openalex.org/W4292363360","https://openalex.org/W4372046852"],"related_works":["https://openalex.org/W4378529241","https://openalex.org/W2978729728","https://openalex.org/W2483828597","https://openalex.org/W2094757704","https://openalex.org/W2088213153","https://openalex.org/W2064842217","https://openalex.org/W4288966080","https://openalex.org/W2071063111","https://openalex.org/W2154951198","https://openalex.org/W25030584"],"abstract_inverted_index":{"In":[0,38],"this":[1,28,48],"paper,":[2],"we":[3],"propose":[4],"a":[5,57,98],"distributed":[6,42],"algorithm":[7,49],"for":[8,44,70],"solving":[9,45],"coupled":[10],"problems":[11],"with":[12,59],"chordal":[13],"sparsity":[14],"or":[15],"an":[16,68],"inherent":[17],"tree":[18],"structure":[19,85],"which":[20],"relies":[21],"on":[22,82],"primal\u2013dual":[23],"interior-point":[24],"methods.":[25],"We":[26,89],"achieve":[27],"by":[29],"distributing":[30],"the":[31,71,83,87,91],"computations":[32],"at":[33],"each":[34],"iteration,":[35],"using":[36,97],"message-passing.":[37],"comparison":[39],"to":[40,54,56,66],"existing":[41,78],"algorithms":[43],"such":[46],"problems,":[47],"requires":[50],"far":[51],"fewer":[52],"iterations":[53,75],"converge":[55],"solution":[58],"high":[60],"accuracy.":[61],"Furthermore,":[62],"it":[63],"is":[64],"possible":[65],"compute":[67],"upper-bound":[69],"number":[72],"of":[73,93,100],"required":[74],"which,":[76],"unlike":[77],"methods,":[79],"only":[80],"depends":[81],"coupling":[84],"in":[86],"problem.":[88],"illustrate":[90],"performance":[92],"our":[94],"proposed":[95],"method":[96],"set":[99],"numerical":[101],"examples.":[102]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}