Interior-point methods (also referred to as barrier methods or IPMs) are algorithms for solving linear and non-linear convex optimization problems. IPMs combine two advantages of previously-known algorithms: Theoretically, their run-time is polynomial—in contrast to the simplex method, which has exponential run-time in the worst case.
Interior-point methods (also referred to as barrier methods or IPMs) are algorithms for solving linear and non-linear convex optimization problems. IPMs combine two advantages of previously-known algorithms: Theoretically, their run-time is polynomial—in contrast to the simplex method, which has exponential run-time in the worst case.
Source: Wikipedia "Interior-point method" · CC BY-SA 4.0
Share this article: X · Bluesky