Projectively Self-Concordant Barriers: Projective Self-Concordance with γ = (ν − 2)/√(ν − 1) Is Equivalent to Self-Concordance of the Logarithmically Homogeneous Extension ν(−log t + f(x/t))Research Paper
Interior-point methods for convex programming, introduced in their modern form by Nesterov and Nemirovski, run Newton's method on a barrier function of the feasible set. Their complexity analysis rests on a single analytic property of the barrier, self-concordance: the third derivative is controlled by the second, .…