{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-dual-ascent-framework-for-lagrangean","title":"A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems","arxiv_id":"1612.05460","date":"2016-12-16","proceeding":"CVPR 2017 7","authors":["Paul Swoboda","Jan Kuske","Bogdan Savchynskyy"],"abstract":"We propose a general dual ascent framework for Lagrangean decomposition of\ncombinatorial problems. Although methods of this type have shown their\nefficiency for a number of problems, so far there was no general algorithm\napplicable to multiple problem types. In his work, we propose such a general\nalgorithm. It depends on several parameters, which can be used to optimize its\nperformance in each particular setting. We demonstrate efficacy of our method\non graph matching and multicut problems, where it outperforms state-of-the-art\nsolvers including those based on subgradient optimization and off-the-shelf\nlinear programming solvers.","url_abs":"http://arxiv.org/abs/1612.05460v2","url_pdf":"http://arxiv.org/pdf/1612.05460v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-dual-ascent-framework-for-lagrangean","repo_url":"https://github.com/pawelswoboda/LP_MP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"graph-matching","task_name":"Graph Matching"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1612.05460","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}