{"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-study-of-lagrangean-decompositions-and-dual","title":"A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching","arxiv_id":"1612.05476","date":"2016-12-16","proceeding":"CVPR 2017 7","authors":["Paul Swoboda","Carsten Rother","Hassan Abu Alhaija","Dagmar Kainmueller","Bogdan Savchynskyy"],"abstract":"We study the quadratic assignment problem, in computer vision also known as\ngraph matching. Two leading solvers for this problem optimize the Lagrange\ndecomposition duals with sub-gradient and dual ascent (also known as message\npassing) updates. We explore s direction further and propose several additional\nLagrangean relaxations of the graph matching problem along with corresponding\nalgorithms, which are all based on a common dual ascent framework. Our\nextensive empirical evaluation gives several theoretical insights and suggests\na new state-of-the-art any-time solver for the considered problem. Our\nimprovement over state-of-the-art is particularly visible on a new dataset with\nlarge-scale sparse problem instances containing more than 500 graph nodes each.","url_abs":"http://arxiv.org/abs/1612.05476v2","url_pdf":"http://arxiv.org/pdf/1612.05476v2.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-study-of-lagrangean-decompositions-and-dual","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":{"syntology_url":"https://syntology.ai/paper/1612.05476","atlas_url":"https://app.syntology.ai/?focus=1612.05476","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}