Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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?

share|cite|improve this question

If $x_i$ would be associated not with paths but nodes of undirected graph it would looks similar to result of "functional lifting" method of convexificaton, for example Tom Goldstein et al "Global minimization of markov random fields with applications to optical flow"

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.