A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial
Problems

v1v2 (latest)

A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems

16 December 2016

Bogdan Savchynskyy

ArXiv (abs)PDF HTML

Papers citing "A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems"

10 / 10 papers shown

Title
Efficient Linear Attention for Fast and Accurate Keypoint Matching Suwichaya Suwanwimolkul S. Komorita 3DPC 3DV 72 11 0 16 Apr 2022
RAMA: A Rapid Multicut Algorithm on GPU A. Abbas Paul Swoboda 94 10 0 04 Sep 2021
Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths Andrea Hornáková Timo Kaiser Paul Swoboda Michal Rolínek Bodo Rosenhahn Roberto Henschel VOT 94 38 0 24 Aug 2021
Fusion Moves for Graph Matching Lisa Hutschenreiter Stefan Haller Lorenz Feineis Carsten Rother Dagmar Kainmüller Bogdan Savchynskyy 99 15 0 28 Jan 2021
Discrete graphical models -- an optimization perspective Bogdan Savchynskyy 76 26 0 24 Jan 2020
Synchronisation of Partial Multi-Matchings via Non-negative Factorisations Florian Bernard J. Thunberg Jorge M. Gonçalves Christian Theobalt 72 31 0 16 Mar 2018
DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems Florian Bernard Christian Theobalt Michael Möller 99 43 0 29 Nov 2017
On Coordinate Minimization of Convex Piecewise-Affine Functions Tomáš Werner 54 1 0 14 Sep 2017
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching Paul Swoboda Carsten Rother Hassan Abu Alhaija Dagmar Kainmüller Bogdan Savchynskyy 85 59 0 16 Dec 2016
A Message Passing Algorithm for the Minimum Cost Multicut Problem Paul Swoboda Bjoern Andres 70 28 0 16 Dec 2016