2016/09/27 by Maëva Biret, Michel Broniatowski, Biret, Maeva +1 · 1 citation
Computer Science · Engineering · Mathematics · #Applications (stat.AP) #FOS: Computer and information sciences #Matrix Theory and Algorithms #Numerical methods in inverse problems #Sparse and Compressive Sensing Techniques
paper · pdf · doi:10.48550/arxiv.1609.08328
openalex publication_date 2016/09/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper presents a new algorithm which aims at the resolution of inverse problems of the form f(x) = 0, for x a vector of dimension d and f an arbitrary function with mild regularity condition. The set of solutions S may be infinite. This algorithm produces a good coverage of S, with a limited number of evaluations of the function f. It is therefore appropriate for complex problems where those evaluations are costly. Various examples are presented, with d varying from 2 to 10. Proofs of convergence and of coverage of S are presented.