The minimal cost of approximating linear operators using perturbed information -- the asymptotic setting
From MaRDI portal
Publication:2365845
DOI10.1006/jcom.1993.1008zbMath0801.47011OpenAlexW2089105903MaRDI QIDQ2365845
Bolesław Kacewicz, Leszek Plaskota
Publication date: 29 June 1993
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1993.1008
Control/observation systems with incomplete information (93C41) Perturbation theory of linear operators (47A55) Problems with incomplete information (optimization) (49N30)
Related Items (1)
This page was built for publication: The minimal cost of approximating linear operators using perturbed information -- the asymptotic setting