𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of multilinear problems in the worst case setting

✍ Scribed by Tomasz Jackowski

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
892 KB
Volume
6
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Worst Case Complexity of Problems with R
Worst Case Complexity of Problems with Random Information Noise
✍ Leszek Plaskota πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 326 KB

We study the worst case complexity of solving problems for which information is partial and contaminated by random noise. It is well known that if information is exact then adaption does not help for solving linear problems, i.e., for approximating linear operators over convex and symmetric sets. On

Discontinuous information in the worst c
Discontinuous information in the worst case and randomized settings
✍ Aicke Hinrichs; Erich Novak; Henryk WoΕΊniakowski πŸ“‚ Article πŸ“… 2012 πŸ› John Wiley and Sons 🌐 English βš– 180 KB

## Abstract We believe that discontinuous linear information is never more powerful than continuous linear information for approximating continuous operators. We prove such a result in the worst case setting. In the randomized setting we consider compact linear operators defined between Hilbert spa