Disciplined Convex Programming
Abstract¶
A new methodology for constructing convex optimization models called disciplined convex programming is introduced. The methodology enforces a set of conventions upon the models constructed, in turn allowing much of the work required to analyze and solve the models to be automated.
Summary¶
Defines disciplined convex programming as a grammar for constructing convex models that software can verify and transform automatically. The paper is the conceptual foundation for CVX-style modeling systems and later tools such as CVXPY.
Links¶
Knowledge Base
External
Tags¶
Similar Papers¶
1
81%
2
74%
3
73%
Graph Implementations for Nonsmooth Convex Programs
Graph Implementations for Convex Programs
4
72%
5
71%