Description: CVX is a modeling system for constructing and solving disciplined convex programs (DCPs). CVX supports
a number of standard problem types, including linear and quadratic programs (LPs/QPs), second-order
cone programs (SOCPs), and semidefinite programs (SDPs). CVX can also solve much more complex
convex optimization problems, including many involving nondifferentiable functions, such as `1 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 mixed
integer disciplined convex programs (MIDCPs) as well, with an appropriate integer-capable solver.
To Search:
File list (Check if you may need any files):
CVX.pdf
Download