Convex Optimization

- Natural & Formal Sciences -
Mathematics & Logic Dictionary
An optimization framework where the objective function is convex and the feasible set is a convex set, guaranteeing any local minimum is a global minimum and enabling efficient solution methods.