line">¶</a></h2>
<p><em>Disciplined convex programming</em> is a methodology for constructing
convex optimization problems proposed by
Michael Grant, Stephen Boyd, and Yinyu Ye <a class="reference internal" href="credits.html#gby06" id="id6">[GBY06]</a>, <a class="reference internal" href="credits.html#gra04" id="id7">[Gra04]</a>.
It is meant to support the formulation and construction of optimization
problems that the user intends <em>from the outset</em> to be convex.</p>
<p id="index-6">Disciplined conv