Abstract
In his talk on November 4, S. Boyd mentioned interior point methods as a
very efficient tool to solve the convex optimization problems that were
the topic of his talk. I will consider LP (linear programming) problems
and explain which interior point methods are applied and how they work.
For the methods that represent the current state of the art detailed
results on real-life problems of very large dimensions will be presented.
