Exact Recovery with Symmetries for the Doubly Stochastic Relaxation

DOI10.1137/17M1132264zbMath1409.90140arXiv1705.07765MaRDI QIDQ4554591

Nadav Dym

Publication date: 9 November 2018

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.07765

zbMATH Keywords

quadratic assignmentconvex relaxationgraph matchingdoubly stochasticexact recovery

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25)

Cites Work

• Gromov-Wasserstein distances and the metric approach to object matching
• A survey for the quadratic assignment problem
• Semidefinite programming relaxations for the quadratic assignment problem
• On convex relaxation of graph isomorphism
• P-Complete Approximation Problems
• Numerical Optimization
• On spectral properties for graph matching and graph isomorphism problems
• Cone-LP's and semidefinite programs: Geometry and a simplex-type method
• Exact Recovery with Symmetries for Procrustes Matching
• Graph isomorphism in quasipolynomial time [extended abstract]
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact Recovery with Symmetries for the Doubly Stochastic Relaxation