Interior-point method
id:
interior-point-method-204-15624943
title:
Interior-point method
text:
Interior-point methods 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.
- Practically, they run as fast as the simplex method—in contrast to the ellipsoid method, which has polynomial run-time in theory but is very slow in practice. In contrast to the simplex method which tr
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithms for solving convex optimization problems
original url:
https://en.wikipedia.org/wiki/Interior-point_method
date created:
2005-03-19T14:50:01Z
date modified:
2024-09-10T14:57:39Z
main entity:
{"identifier":"Q461992","url":"https://www.wikidata.org/entity/Q461992"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/e/e2/Karmarkar.svg","width":720,"height":540}
fields total:
13
integrity:
16