Abstract
Minimax-optimal interpolation algorithms minimize the error resulting from the worst signal from an allowable class. The result is presented that if this class lies in a Hilbert space, the minimax-optimal algorithm is independent of or invariant to the error norm. The result encompasses a broad class of inverse problems.
Original language | English (US) |
---|---|
Pages (from-to) | 1177-1181 |
Number of pages | 5 |
Journal | IEEE Transactions on Information Theory |
Volume | 38 |
Issue number | 3 |
DOIs | |
State | Published - May 1992 |
Keywords
- Hilbert space
- Optimal interpolation
- approximation
- inverse-problems
- pseudo-inverse
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences