Metraipolis › archive › dc_aa08ff464464
Chebyshev center — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Chebyshev_center
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T22:48:19.398Z
- SHA-256 of the archived text
1c780501df6c88672793b4360954e92167dc6519b456090e457e25b84679e109- Stable URL of this page
https://metraipolis.com/documento/dc_aa08ff464464
How to cite
Chebyshev center — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Chebyshev_center (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_aa08ff464464 (Metraipolis archive dc_aa08ff464464, sha256 1c780501df6c88672793b4360954e92167dc6519b456090e457e25b84679e109)
BibTeX
@misc{dcaa08ff464464,
title = {Chebyshev center — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Chebyshev_center},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_aa08ff464464; sha256 1c780501df6c88672793b4360954e92167dc6519b456090e457e25b84679e109},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Chebyshev_center. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In geometry, the Chebyshev center of a bounded set Q {\displaystyle Q} having non-empty interior can mean two different things: it can be the center of the minimal-radius ball enclosing the entire set Q {\displaystyle Q} , or it can be the center of a largest inscribed ball of Q {\displaystyle Q} . To see that these are not equivalent, it suffices to consider as Q {\displaystyle Q} a triangle where one side is much shorter than the two others; the enclosed kind of Chebyshev center will be in the vicinity of the midpoints of the two long sides, whereas the inscribed kind of Chebyshev center will be in the vicinity of the short side, where the triangle is thickest. This article is mostly about the enclosing kind of Chebyshev center. In the field of parameter estimation, the Chebyshev center approach tries to find an estimator x ^ {\displaystyle {\hat {x}}} for x {\displaystyle x} given the feasibility set Q {\displaystyle Q} , such that x ^ {\displaystyle {\hat {x}}} minimizes the worst possible estimation error for x (e.g. best worst case). This is equivalent to the enclosing kind of Chebyshev center.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «mathematical optimization»).
Fonte: Wikipedia in inglese, voce «Chebyshev center» — https://en.wikipedia.org/wiki/Chebyshev_center
Wikidata Q5089012 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5089012
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Chebyshev_center?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1366492778, consultata il 2026-10-07T22:22:36.718Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 63dbcfd7a6eac8694d319b166b0834c6b6db1d0f7396ddb2ec22292bdb152d59