We provide improved complexity results for symmetric primal--dual interior-point algorithms in conic optimization. The results follow from new uniform bounds on a key complexity measure for primal--dual metrics at pairs of primal and dual points. The complexity measure is defined as the largest eigenvalue of the product of the Hessians of the primal and dual barrier functions, normalized by the proximity of the points to the central path. For algorithms based on self-scaled barriers for symmetric cones, we determine the exact value of the complexity measure. In the significantly more general case of self-concordant barriers with negative curvature, we provide the asymptotically tight upper bound of 4/3. This result implies O (^1/2 (1/ε) ) iteration complexity for a variety of symmetric (and some nonsymmetric) primal--dual interior-point algorithms. Finally, in the case of general self-concordant barriers, we give improved bounds for some variants of the complexity measure.
Dahl et al. (Fri,) studied this question.