A Convex Analysis View of the Barrier Problem

Besides the simplex algorithm, linear programs can also be solved via interior point methods. The theoretical background of such algorithms is the classical log-barrier problem. The aim of this note is to study and generalize the barrier problem using the standard tools of Convex Analysis.