Successfully employing cutting planes can be challenging because there are infinitely many cuts to choose from and there are still many open questions about which cuts to employ when.
Matrix factorization is known to be very ill-posed. Factorizations for any matrix are in principle easy to find: we can simply choose one of the factors at will (as afull-rank matrix) and recover a compatible factor by pseudoinversion.