Beyond Convex for Global Optimization

Paritosh Mokhasi

This talk focuses on generalizations of the convex optimization algorithms that allow us to solve a much broader category of problems. We discuss the construction of generalized convex functions and provide details on how such problems are solved within the Mathematica optimization framework.