Stanford AA222 I Engineering Design Optimization | Spring 2025 | Disciplined Convex Programming
Stanford Online · 36:01
Disciplined convex programming (DCP) is a restricted, automatically checkable subclass of convex optimization: if you build a problem from registered atoms using product-free sign rules and composition rules, packages...