Experimental design for over-determined problems is a well studied topic where different criteria and optimization algorithms are explored. For ill-posed problems experimental design is rather new. In this paper we discuss optimal experimental design for ill-posed problems and suggest a numerical framework to efficiently achieve such a design. We demonstrate the effectiveness of our algorithm a...

Information complexity of ill-posed problems may be seen as controversial. On the one hand side there were pessimistic results stating that the complexity is in nite, while on the other hand side the theory of ill-posed problems is well developed. In contrast to well-posed problems (continuous solution operators) the complexity analysis of ill-posed problems (discontinuous solution operators) i...