Graph Implementations for Nonsmooth Convex Programs

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We describe graph implementations, a generic method for representing a convex function via its epigraph, described in a disciplined convex programming framework. This simple and natural idea allows a very wide variety of smooth and nonsmooth convex programs to be easily specified and efficiently solved, using interiorpoint methods for smooth or cone convex programs.