{"id":"https://openalex.org/W2007253528","doi":"https://doi.org/10.1109/cdc.2013.6760235","title":"A dual decomposition algorithm for separable nonconvex optimization using the penalty function framework","display_name":"A dual decomposition algorithm for separable nonconvex optimization using the penalty function framework","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2007253528","doi":"https://doi.org/10.1109/cdc.2013.6760235","mag":"2007253528"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2013.6760235","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2013.6760235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"52nd IEEE Conference on Decision and Control","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/A5003185205","display_name":"Quoc Tran Dinh","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Quoc Tran Dinh","raw_affiliation_strings":["Department of Electrical Engineering (ESAT/SCD), Optimization in Engineering Center (OPTEC), KU Leuven, Belgium","Dept. of Electr. Eng., KU Leuven, Leuven, , Belgium"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering (ESAT/SCD), Optimization in Engineering Center (OPTEC), KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Dept. of Electr. Eng., KU Leuven, Leuven, , Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019114471","display_name":"Ion Necoara","orcid":"https://orcid.org/0000-0003-1102-2654"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Ion Necoara","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Romania","Autom. Control & Syst. Eng. Dept., Univ. Politeh. Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]},{"raw_affiliation_string":"Autom. Control & Syst. Eng. Dept., Univ. Politeh. Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057375078","display_name":"Moritz Diehl","orcid":"https://orcid.org/0000-0001-6556-8252"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Moritz Diehl","raw_affiliation_strings":["Department of Electrical Engineering (ESAT/SCD), Optimization in Engineering Center (OPTEC), KU Leuven, Belgium","Dept. of Electr. Eng., KU Leuven, Leuven, , Belgium"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering (ESAT/SCD), Optimization in Engineering Center (OPTEC), KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Dept. of Electr. Eng., KU Leuven, Leuven, , Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003185205"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":1.5149,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.84447427,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2372","last_page":"2377"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.9897000193595886,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9764000177383423,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/convergence","display_name":"Convergence (economics)","score":0.7145727872848511},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.7120653986930847},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.7078565359115601},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7012379765510559},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.654962420463562},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.6444357633590698},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.516899585723877},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5167869329452515},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5154231786727905},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5116791725158691},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.49771907925605774},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.48662838339805603},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4336010813713074},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4279095530509949},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3859320878982544},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38524526357650757}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7145727872848511},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.7120653986930847},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.7078565359115601},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7012379765510559},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.654962420463562},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.6444357633590698},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.516899585723877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5167869329452515},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5154231786727905},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5116791725158691},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.49771907925605774},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.48662838339805603},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4336010813713074},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4279095530509949},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3859320878982544},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38524526357650757},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/cdc.2013.6760235","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2013.6760235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"52nd IEEE Conference on Decision and Control","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1603765807","https://openalex.org/W2008128853","https://openalex.org/W2030224660","https://openalex.org/W2033121805","https://openalex.org/W2033648544","https://openalex.org/W2081316950","https://openalex.org/W2085890234","https://openalex.org/W2092235910","https://openalex.org/W2105576913","https://openalex.org/W2106821132","https://openalex.org/W2106841741","https://openalex.org/W2128610608","https://openalex.org/W2131869695","https://openalex.org/W2146487916","https://openalex.org/W2155677404","https://openalex.org/W2471988522","https://openalex.org/W2592679011","https://openalex.org/W2950755966","https://openalex.org/W2963183767","https://openalex.org/W3123373735","https://openalex.org/W4300448178","https://openalex.org/W6658901448","https://openalex.org/W6681509756"],"related_works":["https://openalex.org/W2009525028","https://openalex.org/W4321064619","https://openalex.org/W2018662469","https://openalex.org/W2062802260","https://openalex.org/W1977335770","https://openalex.org/W2175677697","https://openalex.org/W4387870386","https://openalex.org/W2510140549","https://openalex.org/W2187449906","https://openalex.org/W2962818859"],"abstract_inverted_index":{"We":[0,22],"propose":[1],"a":[2,25,47,53],"dual":[3,48],"decomposition":[4,49,55],"method":[5],"for":[6],"solving":[7],"separable":[8],"nonconvex":[9],"optimization":[10],"problems":[11],"that":[12],"arise":[13],"e.g.":[14],"in":[15],"distributed":[16],"model":[17],"predictive":[18],"control":[19],"over":[20],"networks.":[21],"first":[23],"derive":[24],"new":[26],"sequential":[27],"convex":[28],"programming":[29],"(SCP)":[30],"scheme":[31,45],"based":[32],"on":[33],"penalty":[34],"function":[35],"approach":[36],"to":[37,51,75],"handle":[38],"nonconvexity.":[39],"Then,":[40],"we":[41],"combine":[42],"this":[43,61],"SCP":[44],"with":[46],"algorithm":[50,62],"obtain":[52],"two-level":[54],"algorithm.":[56],"The":[57],"global":[58],"convergence":[59],"of":[60],"is":[63],"analyzed":[64],"under":[65],"standard":[66],"assumptions.":[67],"Some":[68],"preliminary":[69],"numerical":[70],"results":[71],"are":[72],"also":[73],"given":[74],"illustrate":[76],"the":[77],"theoretical":[78],"results.":[79]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}