Radius of information for two intersected centered hyperellipsoids and implications in optimal recovery from inaccurate data (Q6540038)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Radius of information for two intersected centered hyperellipsoids and implications in optimal recovery from inaccurate data |
scientific article; zbMATH DE number 7849567
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Radius of information for two intersected centered hyperellipsoids and implications in optimal recovery from inaccurate data |
scientific article; zbMATH DE number 7849567 |
Statements
Radius of information for two intersected centered hyperellipsoids and implications in optimal recovery from inaccurate data (English)
0 references
15 May 2024
0 references
This paper considers the problem of how to determine the optimal way to recover the linear quantities of objects belonging to a known model set and observed by a specified linear process from a worst-case point of view. It is shown that if the model set is the intersection of two hyperellipsoids centered at the origin, then there is a linear optimal recovery method.
0 references
optimal recovery
0 references
regularization
0 references
semidefinite programming
0 references
\(\mathrm{S}\)-procedure
0 references
0 references