MCMC Algorithms for Computational UQ of Nonnegativity Constrained Linear Inverse Problems
DOI10.1137/18M1234588zbMath1442.65031MaRDI QIDQ5112550
Per Christian Hansen, Johnathan M. Bardsley
Publication date: 29 May 2020
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
inverse problemsMarkov chain Monte CarloBayesian methodsuncertainty quantificationnonnegativity constraints
Ill-posedness and regularization problems in numerical linear algebra (65F22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Inverse problems in linear algebra (15A29) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Statistical and computational inverse problems.
- Spike and slab variable selection: frequentist and Bayesian strategies
- Inverse problems: A Bayesian perspective
- MCMC-Based Image Reconstruction with Uncertainty Quantification
- Analysis of the Gibbs Sampler for Hierarchical Inverse Problems
- An MCMC method for uncertainty quantification in nonnegativity constrained inverse problems
- Sampling-Based Analysis of a Spatially Distributed Model for Liver Metabolism at Steady State
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- A Nonnegatively Constrained Convex Programming Method for Image Reconstruction
- Gaussian Markov Random Fields
- The Spike-and-Slab LASSO
- Discrete Inverse Problems
- Introduction to Bayesian Scientific Computing
- MCMC methods for functions: modifying old algorithms to make them faster
This page was built for publication: MCMC Algorithms for Computational UQ of Nonnegativity Constrained Linear Inverse Problems