## Abstract

Inference by means of mathematical modeling from a collection of observations remains a crucial tool for scientific discovery and is ubiquitous in application areas such as signal compression, imaging restoration, and supervised machine learning. With ever-increasing model complexities and larger data sets, new specially designed methods are urgently needed to recover meaningful quantities of interest. We consider the broad spectrum of linear inverse problems where the aim is to reconstruct quantities with a sparse representation on some vector space. We provide a new variable projection augmented Lagrangian algorithm to solve the underlying ℓ^{1} regularized inverse problem that is both efficient and effective. We present the proof of convergence for an algorithm using an inexact step for the projected problem at each iteration. The performance and convergence properties for various imaging problems are investigated. The efficiency of the algorithm makes it feasible to automatically find the regularization parameter, here illustrated using an argument based on the degrees of freedom of the objective function equipped with a bisection algorithm for root-finding.

Original language | English (US) |
---|---|

Pages (from-to) | 297-318 |

Number of pages | 22 |

Journal | Applied Numerical Mathematics |

Volume | 192 |

DOIs | |

State | Published - Oct 2023 |

## Keywords

- Alternating Direction Method of Multipliers (ADMM)
- Inverse problems
- Regularization
- Variable projection
- χ test

## ASJC Scopus subject areas

- Numerical Analysis
- Computational Mathematics
- Applied Mathematics

## Fingerprint

Dive into the research topics of 'A variable projection method for large-scale inverse problems with ℓ^{1}regularization'. Together they form a unique fingerprint.