emidefinite programs (SDPs). CVX can also solve much more complex convex
optimization problems, including many involving nondifferentiable
functions, such as <span class="math">\(\ell_1\)</span> norms. You can use CVX to conveniently
formulate and solve constrained norm minimization, entropy maximization,
determinant maximization, and many other convex programs. As of version
2.0, CVX also solves <a class="reference internal" href="#what-is-midcp"><em>mixed integer disciplined convex programs</em></a> (MIDC