A sufficient condition for self-concordance, with application to some classes of structured convex programming problems

Recently a number of papers were written that present low-complexity interior-point methods for different classes of convex programs. The goal of this article is to show that the logarithmic barrier function associated with these programs is self-concordant. Hence the polynomial complexity results for these convex programs can be derived from the theory of Nexterov and Nemirovsky on self-concordant barrier functions. The authors also show that the approach can be applied to some other known classes of convex problems.