On primal-dual interior-point algorithms for convex optimisation