Talk:Ellipsoid method

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

C

This article has been given a rating which conflicts with the project-independent quality rating in the banner shell. Please resolve this conflict if possible.

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Systems Mid‑importance

	Systems science portal This article is within the scope of WikiProject Systems, which collaborates on articles related to systems and systems science.SystemsWikipedia:WikiProject SystemsTemplate:WikiProject SystemsSystems articles
Mid	This article has been rated as Mid-importance on the project's importance scale.
	This article is within the field of Operations research.

untitled

Simplex is slower in the asymptotic worst case than Ellipsoid. Changing this unless I am missing something.Lonjers (talk) 13:21, 16 June 2009 (UTC)[reply]

Interior point methods

Could 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)[reply]

Assessment comment

The 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

The 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)[reply]