A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
From MaRDI portal
Publication:679565
DOI10.1016/j.cam.2017.10.006zbMath1503.65078OpenAlexW2765658755MaRDI QIDQ679565
Publication date: 11 January 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2017.10.006
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
High-order lumps, high-order breathers and hybrid solutions for an extended \((3+1)\)-dimensional Jimbo-Miwa equation in fluid dynamics, Two-party quantum key agreement over a collective noisy channel, New quantum key agreement protocols based on cluster states, On positive solutions for some second-order three-point boundary value problems with convection term
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gradient methods for minimizing composite functions
- Heuristic regularization methods for numerical differentiation
- Fixed point and Bregman iterative methods for matrix rank minimization
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- On the discrepancy principle for some Newton type methods for solving nonlinear inverse problems
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Estimation of the mean of a multivariate normal distribution
- A practical guide to splines
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- Least angle regression. (With discussion)
- Exploiting residual information in the parameter choice for discrete ill-posed problems
- Atomic Decomposition by Basis Pursuit
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Shrinkage Tuning Parameter Selection with a Diverging number of Parameters
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- A Duality-Based Splitting Method for $\ell^1$-$TV$ Image Restoration with Automatic Regularization Parameter Choice
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Iteratively Reweighted Least Squares: Algorithms, Convergence Analysis, and Numerical Comparisons
- Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
- An EM algorithm for wavelet-based image restoration
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
- Probing the Pareto Frontier for Basis Pursuit Solutions
- A Semismooth Newton Method for $\mathrm{L}^1$ Data Fitting with Automatic Choice of Regularization Parameters and Noise Calibration
- Iteratively reweighted least squares minimization for sparse recovery
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Sparse Reconstruction by Separable Approximation
- Regularization Parameter Selection for Nonlinear Iterative Image Restoration and MRI Reconstruction Using GCV and SURE-Based Methods
- Computer Vision - ECCV 2004
