# Interior point method

### From Glossary

A family of algorithms that stays in the strict interior of the
feasible region, possibly through the use of a barrier function. The
term grew from Karmarkar's algorithm to solve a linear program. In that case, the resulting solution (if it exists) is
strictly complementary, which defines the (unique) optimal partition.