Beyond the Birkhoff Polytope: Convex Relaxations for Vector Permutation Problems

The Birkhoff polytope (the convex hull of the set of permutation matrices), which is represented using Θ(n2) variables and constraints, is frequently invoked in formulating relaxations of optimization problems over permutations. Using a recent construction of Goemans [1], we show that when optimizing over the convex hull of the permutation vectors (the permutahedron), we can reduce the number of variables and constraints to Θ(n log n) in theory and Θ(n log2 n) in practice. We modify the recent convex formulation of the 2-SUM problem introduced by Fogel et al. [2] to use this polytope, and demonstrate how we can attain results of similar quality in significantly less computational time for large n. To our knowledge, this is the first usage of Goemans' compact formulation of the permutahedron in a convex optimization problem. We also introduce a simpler regularization scheme for this convex formulation of the 2-SUM problem that yields good empirical results.

[1]  W. S. Robinson.  A Method for Chronologically Ordering Archaeological Deposits , 1951, American Antiquity.

[2]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[3]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[4]  H. Ross.  Principles of Numerical Taxonomy , 1964 .

[5]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[6]  F. Hodson.  The La Tène cemetery at Münsingen-Rain : catalogue and relative chronology , 1968 .

[7]  D. Kendall.  Abundance matrices and seriation in archaeology , 1971 .

[8]  Ingram Olkin,et al.  Inequalities: Theory of Majorization and Its Application , 1979 .

[9]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[10]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[11]  A. George,et al.  An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems , 1997, SIAM J. Matrix Anal. Appl..

[12]  Bruce Hendrickson,et al.  A Spectral Algorithm for Seriation and the Consecutive Ones Problem , 1999, SIAM J. Comput..

[13]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[14]  Chris H. Q. Ding,et al.  Linearized cluster assignment via spectral ordering , 2004, ICML.

[15]  Maurice Queyranne,et al.  Polyhedral Approaches to Machine Scheduling , 2008 .

[16]  Stephen P. Boyd,et al.  Graph Implementations for Nonsmooth Convex Programs , 2008, Recent Advances in Learning and Control.

[17]  Niko Vuokko,et al.  Consecutive Ones Property and Spectral Ordering , 2010, SDM.

[18]  Innar Liiv,et al.  Seriation and matrix reordering methods: An historical overview , 2010, Stat. Anal. Data Min..

[19]  Masayuki Takeda,et al.  Online Linear Optimization over Permutations , 2011, ISAAC.

[20]  Guillermo Sapiro,et al.  Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching , 2013, NIPS.

[21]  Alexandre d'Aspremont,et al.  Convex Relaxations for Permutation Problems , 2013, SIAM J. Matrix Anal. Appl..

[22]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[23]  Stephen J. Wright,et al.  Beyond the Birkhoff Polytope: Convex Relaxations for Vector Permutation Problems , 2014, NIPS.

[24]  Michel X. Goemans,et al.  Smallest compact formulation for the permutahedron , 2015, Math. Program..