Will YALMIP automatically exploit the sparsity of matrices in the optimization problem?

[Jiaxin Yang]

Hello, I have a question. In the semidefinite programming, suppose I have a linear matrix inequality [A, B; C, D]; If some of them (e.g., A and B) have many zero elements, will the solver automatically exploit the sparse properties and reduce the time of solving the SDP?

Thank you very much.

[Johan Löfberg]

All solvers use sparse matrix algebra.