Interior point methods E=(M t1 *V t1 - M t0 *V t0 - F t1 *dt)*V One way to solve convex optimization problems is piecewise quadratic programming, another is the interior point method which is what we will use.
{}