Groups
Category
A convex optimization problem minimizes a convex function over a convex set, guaranteeing that every local minimum is a global minimum.
Lagrange multipliers let you optimize a function while strictly satisfying equality constraints by introducing auxiliary variables (the multipliers).