ISSN:
1436-4646
Keywords:
42B05
;
62A99
;
Maximum entropy
;
Linear programming
;
Inverse problems
;
Superresolution
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract In this paper, we give two different results. We propose new methods to solve classical optimization problems in linear programming. We also obtain precise quantitative results for the superresolution phenomenon, as observed earlier by practical searchers on specific algorithms. The common background of our work is the generalized moment problem, which is known to be connected with linear programming and superresolution. We describe the Maximum Entropy Method on the Mean that provides solution to the problem and leads to computational criteria to decide the existence of solutions or not.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01581139
Permalink