Talk:Ellipsoid method
 | This  level-5 vital article is rated Start-class on Wikipedia's content assessment scale.It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||
untitled
editSimplex is slower in the asymptotic worst case than Ellipsoid. Changing this unless I am missing something.Lonjers (talk) 13:21, 16 June 2009 (UTC)
Interior point methods
editCould somebody give a reference for the following statement: "Only in the 21st Century have interior-point algorithms with similar complexity properties appeared." — Preceding unsigned comment added by 128.16.10.151 (talk) 10:38, 17 March 2013 (UTC)
Assessment comment
editThe comment(s) below were originally left at Talk:Ellipsoid method/Comments, and are posted here for posterity. Following several discussions in past years, these subpages are now deprecated. The comments may be irrelevant or outdated; if so, please feel free to remove this section.
| Writing "However, the interior-point method and variants of the simplex algorithm are much faster than the ellipsoid method, in both theory and practice." is incorrect. There is no variant of the simplex method known to run in polynomial time; therefore, it cannot be faster in theory. |
Last edited at 21:14, 14 November 2008 (UTC). Substituted at 14:22, 29 April 2016 (UTC)
Bad performance of Ellipsoid method
editThe ellipsoid method is worse than the simplex method except for specifically crafted families according to sentence 2 here. Is someone aware of a source for a proof of this fact? Then it would be appropiate to add it to this article. Mathelerner (talk) 09:41, 22 July 2022 (UTC)