Taxonomy of [[optimization]] problems: ![[neos optimization problem types.png]] > from [Optimization Problem Types - NEOS Guide](https://neos-guide.org/guide/types/) An optimization problem is often called a **program** (as in a "concert program" / plan) from historical usage in military planning ([[George Dantzig]]). Here we also link to the [[algorithm]]s for solving each problem type. - [[convex program|convex optimization]] - [[linear program]] - [[simplex method]] - [[nonconvex optimization]] - [[continuous optimization]] - [[discrete optimization]] - [[lifting trick]] - [[gradient descent]] Built around [[analysis|calculus]] and [[vector space|linear algebra]] for *multivariate* problems [[deep learning]] when the [[domain]] is [[asymptotic|high dimensional]]