Convex solution of a permutation problem
β
Marko StoΕ‘iΔ; Manuel Marques; JoΓ£o Paulo Costeira
π
Article
π
2011
π
Elsevier Science
π
English
β 164 KB
In this paper, we show that a problem of finding a permuted version of k vectors from R N such that they belong to a prescribed rank r subset, can be solved by convex optimization. We prove that under certain generic conditions, the wanted permutation matrix is unique in the convex set of doubly-sto