Groups
A convex optimization problem minimizes a convex function over a convex set, guaranteeing that every local minimum is a global minimum.
Lagrangian duality turns a constrained minimization problem into a related maximization problem that provides lower bounds on the original objective.