Introduction
Two families of convex problems are so common that they have their own names and dedicated solvers. Linear programs (LPs) have a linear objective and linear constraints — used for scheduling, resource allocation and transport. Quadratic programs (QPs) have a quadratic objective — and the classic support vector machine is one.