Interior-Point Method
Definition
A family of optimization algorithms that traverse the interior of the feasible region, using barrier functions, primal-dual systems, or path-following strategies to approach optimal solutions without explicitly visiting vertices.