Groups
Lagrangian duality turns a constrained minimization problem into a related maximization problem that provides lower bounds on the original objective.
Convex optimization studies minimizing convex functions over convex sets, where every local minimum is guaranteed to be a global minimum.