Homogeneous algorithms and solvable problems on cones (Q6540037)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7849566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Homogeneous algorithms and solvable problems on cones |
scientific article; zbMATH DE number 7849566 |
Statements
Homogeneous algorithms and solvable problems on cones (English)
0 references
15 May 2024
0 references
Optimal recovery and linear approximation problems are standard tasks in numerical analysis. In this paper, best approximations on convex sets are studied. Also, only a limited number of data points (measurements) are allowed. In general a linear approximation method will not be suitable to solve such a problem, but the authors show that a homogeneous algorithm will do this.
0 references
information-based complexity
0 references
optimal recovery
0 references
linear problems
0 references
worst-case analysis
0 references
adaption
0 references
0 references
0 references
0 references
0 references
0 references
0.7555800080299377
0 references
0.7302544116973877
0 references
0.7278768420219421
0 references
0.7260369062423706
0 references
0.7247869968414307
0 references
