These examples show many different ways to use CVXPY.
The Basic examples section shows how to solve some common optimization problems in CVXPY.
The Disciplined geometric programming section shows how to solve log-log convex programs.
The Disciplined quasiconvex programming section has examples on quasiconvex programming.
The Derivatives section shows how to compute sensitivity analyses and gradients of solutions.
There are also application-specific sections.
The Machine learning section is a tutorial on convex optimization in machine learning.
The Advanced and Advanced Applications sections contains more complex examples for experts in convex optimization.
Disciplined geometric programming¶
Disciplined quasiconvex programming¶
Computing a sparse solution of a set of linear inequalities [.ipynb]
Optimal power and bandwidth allocation in a Gaussian broadcast channel [.ipynb]
Power assignment in a wireless communication system [.ipynb]
Sparse covariance estimation for Gaussian variables [.ipynb]