This paper presents two new algorithms to compute sparse solutions of large-scale linear discrete ill-posed problems. The proposed approach consists in constructing a sequence of quadratic problems approximating an `...
This paper presents two new algorithms to compute sparse solutions of large-scale linear discrete ill-posed problems. The proposed approach consists in constructing a sequence of quadratic problems approximating an `...
We devise efficient methods for dynamic inverse problems, where both the quantities of interest and the forward operator (measurement process) may change in time. Our goal is to solve for all the quantities of interest...
We devise efficient methods for dynamic inverse problems, where both the quantities of interest and the forward operator (measurement process) may change in time. Our goal is to solve for all the quantities of interest...
|< |
< |
1 |