Interior Point Methods: A class of optimisation algorithms that navigate the interior of the feasible region to seek optimal solutions, commonly used in linear and convex quadratic programming.