MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

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

Hi. My question is probably very simple to some of you that have experience in Convex Optimization. The dual function is defined as the infimum of the lagrangian $L(x,\lambda, \nu)$ over all $x\ $ in the domain. The lagrangian is: $f_0(x)+\sum \lambda_i f_i(x)+\sum \nu_i h_i(x)$

My question is, if $x\ $ is in the domain, it satisfies the equality constraints $h_i(x)$ and in that case, $h_i(x)=0$. So why do we even have to mention the equality constraints if they zero-out anyway?

Thanks a lot, I hope I wrote my question clearly.

share|cite|improve this question
up vote 0 down vote accepted

The domain in question is the intersection of all the domains of the functions $f_i,h_i$. Not all the points in the domain satisfy the conditions (such points constitute what's called the feasible set). Also keep in mind that the Lagrangian dual is often a relaxation of the original convex optimization and only gives you a lower bound, unless you have strong duality.

share|cite|improve this answer
So true :) thanks. – ofer Apr 5 '10 at 12:32

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.