I have a nonlinear convex objective function to minimize. The function is defined on a set of variables: $\{ x_1,x_2, \ldots ,x_p \},$ where each $x_i$ is a number associated with a path in the DAG.
I'm wondering if there's previous work available for such convex programming problems when the problem has an underlying combinatorial structure such as a graph?