Construct · 1 fields · 1 citations

ellipsoid method: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Optimization

algorithm that shrinks a sequence of ellipsoids known to contain the optimum, the first proof that linear programming is solvable in polynomial time.

In optimization, ellipsoid method refers to algorithm that shrinks a sequence of ellipsoids known to contain the optimum, the first proof that linear programming is solvable in polynomial time. This meaning comes from Khachiyan (1980) in USSR Computational Mathematics and Mathematical Physics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how ellipsoid method sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

ellipsoid3 fields · 3 citationsjingle · one word, three constructs equivalence of separation and optimization1 fields · 1 citationsanchor · a standalone construct linear programming1 fields · 1 citationsanchor · a standalone construct

References

Khachiyan, L. G. (1980). Polynomial algorithms in linear programming. USSR Computational Mathematics and Mathematical Physics, 20(1), 53-72. https://doi.org/10.1016/0041-5553(80)90061-0

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct