New complexity bounds for primal--dual interior-point algorithms in conic optimization

Joachim Dahl, Levent Tunçel, Lieven Vandenberghe

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 me…