Improving performance for SDPs with "matrix trace constraints"

Declaring the matrices Mr[k] and Mi[k] as sparse matrices seems to significantly imporve performance (~10 fold), also: JuMP does exploit sparsity!

Further performance improvement recommendations are welcome! :smile: