{"id":"https://openalex.org/W2169391377","doi":"https://doi.org/10.1007/s10107-014-0772-2","title":"Primal convergence from dual subgradient methods for convex optimization","display_name":"Primal convergence from dual subgradient methods for convex optimization","publication_year":2014,"publication_date":"2014-04-15","ids":{"openalex":"https://openalex.org/W2169391377","doi":"https://doi.org/10.1007/s10107-014-0772-2","mag":"2169391377"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-014-0772-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-014-0772-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-014-0772-2.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-014-0772-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066227436","display_name":"Emil Gustavsson","orcid":"https://orcid.org/0000-0003-0166-1786"},"institutions":[{"id":"https://openalex.org/I881427289","display_name":"University of Gothenburg","ror":"https://ror.org/01tm6cn81","country_code":"SE","type":"education","lineage":["https://openalex.org/I881427289"]},{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Emil Gustavsson","raw_affiliation_strings":["Department of Mathematical Sciences, Chalmers University of Technology, 412 96\u00a0, G\u00f6teborg, Sweden","Department of Mathematical Sciences, University of Gothenburg, 412 96\u00a0, G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Chalmers University of Technology, 412 96\u00a0, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Department of Mathematical Sciences, University of Gothenburg, 412 96\u00a0, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I881427289"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008055628","display_name":"Michael Patriksson","orcid":"https://orcid.org/0000-0001-7675-7454"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]},{"id":"https://openalex.org/I881427289","display_name":"University of Gothenburg","ror":"https://ror.org/01tm6cn81","country_code":"SE","type":"education","lineage":["https://openalex.org/I881427289"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Michael Patriksson","raw_affiliation_strings":["Department of Mathematical Sciences, Chalmers University of Technology, 412 96\u00a0, G\u00f6teborg, Sweden","Department of Mathematical Sciences, University of Gothenburg, 412 96\u00a0, G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Chalmers University of Technology, 412 96\u00a0, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Department of Mathematical Sciences, University of Gothenburg, 412 96\u00a0, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I881427289"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049531929","display_name":"Ann\u2010Brith Str\u00f6mberg","orcid":"https://orcid.org/0000-0003-1962-7279"},"institutions":[{"id":"https://openalex.org/I881427289","display_name":"University of Gothenburg","ror":"https://ror.org/01tm6cn81","country_code":"SE","type":"education","lineage":["https://openalex.org/I881427289"]},{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Ann-Brith Str\u00f6mberg","raw_affiliation_strings":["Department of Mathematical Sciences, Chalmers University of Technology, 412 96\u00a0, G\u00f6teborg, Sweden","Department of Mathematical Sciences, University of Gothenburg, 412 96\u00a0, G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Chalmers University of Technology, 412 96\u00a0, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Department of Mathematical Sciences, University of Gothenburg, 412 96\u00a0, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I881427289"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066227436"],"corresponding_institution_ids":["https://openalex.org/I66862912","https://openalex.org/I881427289"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":8.313,"has_fulltext":true,"cited_by_count":47,"citation_normalized_percentile":{"value":0.98305085,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"150","issue":"2","first_page":"365","last_page":"390"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.996399998664856,"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.996399998664856,"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.9904000163078308,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9606000185012817,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.9250994920730591},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7917800545692444},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6786167621612549},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6736817955970764},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.586884081363678},{"id":"https://openalex.org/keywords/ergodic-theory","display_name":"Ergodic theory","score":0.5447590351104736},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5054810047149658},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.49901628494262695},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.48241886496543884},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.442690372467041},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43573880195617676},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4219762980937958},{"id":"https://openalex.org/keywords/subderivative","display_name":"Subderivative","score":0.4167467951774597},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41420403122901917},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3615446090698242}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.9250994920730591},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7917800545692444},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6786167621612549},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6736817955970764},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.586884081363678},{"id":"https://openalex.org/C122044880","wikidata":"https://www.wikidata.org/wiki/Q5498822","display_name":"Ergodic theory","level":2,"score":0.5447590351104736},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5054810047149658},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.49901628494262695},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.48241886496543884},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.442690372467041},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43573880195617676},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4219762980937958},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.4167467951774597},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41420403122901917},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3615446090698242},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10107-014-0772-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-014-0772-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-014-0772-2.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:publications.lib.chalmers.se:165918","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/165918-primal-convergence-from-dual-subgradient-methods-for-convex-optimization","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Preprint"},{"id":"pmh:oai:publications.lib.chalmers.se:205239","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/205239-primal-convergence-from-dual-subgradient-methods-for-convex-optimization","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Journal.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:165918","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/165918","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:research.chalmers.se:205239","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/205239","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.1007/s10107-014-0772-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-014-0772-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-014-0772-2.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2169391377.pdf","grobid_xml":"https://content.openalex.org/works/W2169391377.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W965877724","https://openalex.org/W1568288633","https://openalex.org/W1574558330","https://openalex.org/W1669104078","https://openalex.org/W1963529497","https://openalex.org/W1974645784","https://openalex.org/W1975791208","https://openalex.org/W1980084436","https://openalex.org/W1986624101","https://openalex.org/W2015263936","https://openalex.org/W2020123437","https://openalex.org/W2025286039","https://openalex.org/W2033957915","https://openalex.org/W2041221438","https://openalex.org/W2041715582","https://openalex.org/W2045068465","https://openalex.org/W2050014122","https://openalex.org/W2052510704","https://openalex.org/W2061632451","https://openalex.org/W2073819859","https://openalex.org/W2084129396","https://openalex.org/W2090246427","https://openalex.org/W2091371007","https://openalex.org/W2091604953","https://openalex.org/W2091836882","https://openalex.org/W2108303241","https://openalex.org/W2118258531","https://openalex.org/W2119273405","https://openalex.org/W2121676328","https://openalex.org/W2130469840","https://openalex.org/W2135779729","https://openalex.org/W2140409200","https://openalex.org/W2149192560","https://openalex.org/W2149454052","https://openalex.org/W2150123606","https://openalex.org/W2158503783","https://openalex.org/W2159434603","https://openalex.org/W2169528473","https://openalex.org/W2169713291","https://openalex.org/W2172478086","https://openalex.org/W2181039776","https://openalex.org/W2526245011","https://openalex.org/W3176773450","https://openalex.org/W4211092921","https://openalex.org/W4236384091","https://openalex.org/W4400449507"],"related_works":["https://openalex.org/W2172263749","https://openalex.org/W2172478086","https://openalex.org/W2995471588","https://openalex.org/W2036724572","https://openalex.org/W2037016126","https://openalex.org/W149939478","https://openalex.org/W3214021126","https://openalex.org/W2465405765","https://openalex.org/W4297153560","https://openalex.org/W2964186284"],"abstract_inverted_index":{"When":[0],"solving":[1],"a":[2,7,37,53,62,96,138],"convex":[3,56,92],"optimization":[4,12,93],"problem":[5],"through":[6,35],"Lagrangian":[8,42],"dual":[9,22,43],"reformulation":[10],"subgradient":[11,38],"methods":[13],"are":[14,81],"favorably":[15],"utilized,":[16],"since":[17],"they":[18,120,148],"often":[19],"find":[20],"near-optimal":[21],"solutions":[23,127],"quickly.":[24],"However,":[25],"an":[26,48,73],"optimal":[27,49,74],"primal":[28,59,75,112],"solution":[29,76],"is":[30,45,68],"generally":[31],"not":[32],"obtained":[33],"directly":[34],"such":[36],"approach":[39],"unless":[40],"the":[41,78,103,108,134,151],"function":[44],"differentiable":[46],"at":[47],"solution.":[50],"We":[51,84,132],"construct":[52],"sequence":[54,110],"of":[55,58,99,111,140],"combinations":[57],"subproblem":[60,126],"solutions,":[61],"so":[63],"called":[64],"ergodic":[65,109],"sequence,":[66],"which":[67],"shown":[69],"to":[70,72,91,116],"converge":[71],"when":[77],"convexity":[79,104],"weights":[80,105],"appropriately":[82],"chosen.":[83],"generalize":[85],"previous":[86],"convergence":[87],"results":[88],"from":[89,124,129],"linear":[90],"and":[94,145],"present":[95],"new":[97],"set":[98,139],"rules":[100,136],"for":[101],"constructing":[102],"that":[106,147],"define":[107],"solutions.":[113],"In":[114],"contrast":[115],"previously":[117,153],"proposed":[118,135],"rules,":[119],"exploit":[121],"more":[122],"information":[123],"later":[125],"than":[128],"earlier":[130],"ones.":[131],"evaluate":[133],"on":[137],"nonlinear":[141],"multicommodity":[142],"flow":[143],"problems":[144],"demonstrate":[146],"clearly":[149],"outperform":[150],"ones":[152],"proposed.":[154]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}