Optimization, Linear Programming, Convex Optimization, Duality, Towards Data Science.
constraints, or find a “good” enough solution within certain amount of time, such as training the parameters in a deep neural network model to minimize its loss function (a non-convex optimization problem). The following linear programming problem is an example of the former case. For linear