I have encountered an optimization problem. I want to find a matrix P so that
minimize W||APB||_2, s.t. P is a permutation matrix.
where W, A, B are known matrices given by specific parameters in the problem. The norm here is Euclidean norm.
Can this problem be solved by cvx? If so, how to formulate the constraint? Thanks in advance!