Interior-point methods constitute a robust class of algorithms for solving constrained optimisation problems by exploring the interior of the feasible region instead of traversing its boundary. These ...