A differential equations approach to l₁-minimization with applications to array imaging
From MaRDI portal
Publication:3144020
Abstract: We present an ordinary differential equations approach to the analysis of algorithms for constructing minimizing solutions to underdetermined linear systems of full rank. It involves a relaxed minimization problem whose minimum is independent of the relaxation parameter. An advantage of using the ordinary differential equations is that energy methods can be used to prove convergence. The connection to the discrete algorithms is provided by the Crandall-Liggett theory of monotone nonlinear semigroups. We illustrate the effectiveness of the discrete optimization algorithm in some sparse array imaging problems.
Recommendations
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- A generalized l₁ greedy algorithm for image reconstruction in CT
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
Cited in
(6)- Imaging in random media
- Synthetic aperture imaging of direction- and frequency-dependent reflectivities
- Illumination strategies for intensity-only imaging
- The Noise Collector for sparse recovery in high dimensions
- Imaging with highly incomplete and corrupted data
- Speckle imaging with blind source separation and total variation deconvolution
This page was built for publication: A differential equations approach to \(l_{1}\)-minimization with applications to array imaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3144020)
