{"id":"https://openalex.org/W2964561292","doi":"https://doi.org/10.24963/ijcai.2019/629","title":"Combining ADMM and the Augmented Lagrangian Method for Efficiently Handling Many Constraints","display_name":"Combining ADMM and the Augmented Lagrangian Method for Efficiently Handling Many Constraints","publication_year":2019,"publication_date":"2019-07-28","ids":{"openalex":"https://openalex.org/W2964561292","doi":"https://doi.org/10.24963/ijcai.2019/629","mag":"2964561292"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2019/629","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/629","pdf_url":"https://www.ijcai.org/proceedings/2019/0629.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2019/0629.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027313464","display_name":"Joachim Giesen","orcid":"https://orcid.org/0000-0001-6598-6833"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Joachim Giesen","raw_affiliation_strings":["Friedrich-Schiller-Universit\u00e4t Jena"],"affiliations":[{"raw_affiliation_string":"Friedrich-Schiller-Universit\u00e4t Jena","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078697841","display_name":"Soeren Laue","orcid":null},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Soeren Laue","raw_affiliation_strings":["Data Assessment Solutions","Friedrich-Schiller-Universit\u00e4t Jena"],"affiliations":[{"raw_affiliation_string":"Data Assessment Solutions","institution_ids":[]},{"raw_affiliation_string":"Friedrich-Schiller-Universit\u00e4t Jena","institution_ids":["https://openalex.org/I76198965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027313464"],"corresponding_institution_ids":["https://openalex.org/I76198965"],"apc_list":null,"apc_paid":null,"fwci":0.4335,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.71744511,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"4525","last_page":"4531"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.8917950391769409},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7437525987625122},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5929522514343262},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5773624777793884},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.559217631816864},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5361909866333008},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5182988047599792},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5148988962173462},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.5007734298706055},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4720153212547302},{"id":"https://openalex.org/keywords/constrained-optimization-problem","display_name":"Constrained optimization problem","score":0.45716843008995056},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.352047324180603},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3162546157836914}],"concepts":[{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.8917950391769409},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7437525987625122},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5929522514343262},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5773624777793884},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.559217631816864},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5361909866333008},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5182988047599792},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5148988962173462},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.5007734298706055},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4720153212547302},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.45716843008995056},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.352047324180603},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3162546157836914},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2019/629","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/629","pdf_url":"https://www.ijcai.org/proceedings/2019/0629.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2019/629","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/629","pdf_url":"https://www.ijcai.org/proceedings/2019/0629.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4443650897","display_name":null,"funder_award_id":"GI-711/5-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5398132153","display_name":null,"funder_award_id":"DFG grant","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2964561292.pdf","grobid_xml":"https://content.openalex.org/works/W2964561292.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W130696423","https://openalex.org/W1557218204","https://openalex.org/W1565670382","https://openalex.org/W1969549583","https://openalex.org/W2022948311","https://openalex.org/W2025469203","https://openalex.org/W2045079045","https://openalex.org/W2057624533","https://openalex.org/W2105867876","https://openalex.org/W2147609908","https://openalex.org/W2236834722","https://openalex.org/W2530123835","https://openalex.org/W3048180500","https://openalex.org/W3099831354","https://openalex.org/W4292363360"],"related_works":["https://openalex.org/W2911888267","https://openalex.org/W4313189992","https://openalex.org/W2386894418","https://openalex.org/W4319069344","https://openalex.org/W2322632174","https://openalex.org/W2053344917","https://openalex.org/W2039078354","https://openalex.org/W1767215272","https://openalex.org/W2387879781","https://openalex.org/W1533587163"],"abstract_inverted_index":{"Many":[0],"machine":[1,48],"learning":[2,49],"methods":[3,50],"entail":[4],"minimizing":[5],"a":[6,109,123,177],"loss-function":[7],"that":[8,119,153,203],"is":[9,25,93,126],"the":[10,13,22,37,52,57,62,67,80,129,142,147,155,167,181,184,206,213],"sum":[11],"of":[12,21,41,69,82,96,101,169,183,209],"losses":[14],"for":[15,28,103,137,141,146],"each":[16],"data":[17,58,75],"point.":[18,76],"The":[19,98],"form":[20,68],"loss":[23],"function":[24,64],"exploited":[26],"algorithmically,":[27],"instance":[29],"in":[30,36,61,66,108,176],"stochastic":[31],"gradient":[32],"descent":[33],"(SGD)":[34],"and":[35,144,212],"alternating":[38],"direction":[39],"method":[40,187],"multipliers":[42],"(ADMM).":[43],"However,":[44],"there":[45],"are":[46,120],"also":[47],"where":[51],"entailed":[53],"optimization":[54,85,106,174,191],"problem":[55,81],"features":[56],"points":[59],"not":[60],"objective":[63],"but":[65],"constraints,":[70,143],"typically":[71],"one":[72,136,140,145],"constraint":[73],"per":[74],"Here,":[77,150],"we":[78,151,165],"address":[79],"solving":[83,104,154],"convex":[84,89,173],"problems":[86,107,175],"with":[87,180],"many":[88],"constraints.":[90],"Our":[91],"approach":[92,131],"an":[94],"extension":[95],"ADMM.":[97],"straightforward":[99,130],"implementation":[100],"ADMM":[102,170,211],"constrained":[105,113,157,190],"distributed":[110,178],"fashion":[111],"solves":[112],"subproblems":[114,158],"on":[115],"different":[116],"compute":[117],"nodes":[118],"aggregated":[121],"until":[122],"consensus":[124],"solution":[125],"reached.":[127],"Hence,":[128],"has":[132],"three":[133],"nested":[134,199],"loops:":[135],"reaching":[138],"consensus,":[139],"unconstrained":[148],"problems.":[149,192],"show":[152],"costly":[156],"can":[159],"be":[160],"avoided.":[161],"In":[162],"our":[163,194,220],"approach,":[164],"combine":[166],"ability":[168,182],"to":[171,188],"solve":[172,189],"setting":[179],"augmented":[185,214],"Lagrangian":[186,215],"Consequently,":[193],"algorithm":[195],"only":[196],"needs":[197],"two":[198],"loops.":[200],"We":[201],"prove":[202],"it":[204],"inherits":[205],"convergence":[207],"guarantees":[208],"both":[210],"method.":[216],"Experimental":[217],"results":[218],"corroborate":[219],"theoretical":[221],"findings.":[222]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}
