Operations Research.
quadratic term in the objective function is convex (positive semi-definite). The Lagrangian of an optimization problem (not necessarily convex) is a weighted sum of the objective and constraint functions. - The λs and νs are dual variables (a.k.a. Lagrange multipliers), which indicate how sensitive