Stanford EE364a Convex Optimization I: 11 LP/QP/SOCP/SDP programming exercises solved & numerically verified with CVXPY (Boyd)
-
Updated
Jul 8, 2026 - Python
Stanford EE364a Convex Optimization I: 11 LP/QP/SOCP/SDP programming exercises solved & numerically verified with CVXPY (Boyd)
Add a description, image, and links to the boyd topic page so that developers can more easily learn about it.
To associate your repository with the boyd topic, visit your repo's landing page and select "manage topics."