22 citations · 47 across the 35 of their papers we have counts for
4 papers · 1 filter
Quasi Branch and Bound for Smooth Global Optimization
Nadav Dym
Quasi branch and bound is a recently introduced generalization of branch and bound, where lower bounds are replaced by a relaxed notion of quasi-lower bounds, required to be lower…
Sinkhorn Algorithm for Lifted Assignment Problems
Yam Kushinsky, Haggai Maron, Nadav Dym +1
Recently, Sinkhorn's algorithm was applied for approximately solving linear programs emerging from optimal transport very efficiently. This was accomplished by formulating a regula…
Exact Recovery with Symmetries for the Doubly-Stochastic Relaxation
Nadav Dym
Graph matching or quadratic assignment, is the problem of labeling the vertices of two graphs so that they are as similar as possible. A common method for approximately solving the…
Exact Recovery with Symmetries for Procrustes Matching
Nadav Dym, Yaron Lipman
The Procrustes matching (PM) problem is the problem of finding the optimal rigid motion and labeling of two point sets so that they are as close as possible. Both rigid and non-rig…