5

We want to solve an optimization problem over the space of permutation matrices (square binary matrices with exactly one entry of $1$ in each row and each column and $0$s elsewhere) with size $n \times n$, and we relax the constraint so that we operate optimization for orthogonal matrices ($P^TP=PP^T=I$), how would you encourage the matrices to be permutation matrices?

I have tried to add regularization on $\sum_{i,j} P_{ij}^4$. Would you recommend something else?

Vezen BU
  • 2,320

0 Answers0