A pseudo-heuristic parameter selection rule for l^1-regularized minimization problems
From MaRDI portal
Publication:679565
DOI10.1016/J.CAM.2017.10.006zbMATH Open1503.65078OpenAlexW2765658755MaRDI QIDQ679565FDOQ679565
Authors: Chong-Jun Li, Yi-Jun Zhong 
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
Recommendations
- The convergence of a new heuristic parameter selection criterion for general regularization methods
- On the Convergence of a Heuristic Parameter Choice Rule for Tikhonov Regularization
- On pseudo-optimal parameter choice in Tikhonov regularization
- A comparison of parameter choice rules for \(\ell^p\)-\(\ell^q\) minimization
- A General Heuristic for Choosing the Regularization Parameter in Ill-Posed Problems
- A choice of the regularization parameter in solving convex extremal problems
- Heuristic Parameter-Choice Rules for Convex Variational Regularization Based on Error Estimates
- scientific article; zbMATH DE number 7210681
- scientific article; zbMATH DE number 4056420
- scientific article; zbMATH DE number 4094251
Numerical mathematical programming methods (65K05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22)
Cites Work
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- Probing the Pareto frontier for basis pursuit solutions
- Least angle regression. (With discussion)
- Title not available (Why is that?)
- Estimation of the mean of a multivariate normal distribution
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Shrinkage tuning parameter selection with a diverging number of parameters
- Gradient methods for minimizing composite functions
- A practical guide to splines
- Iteratively Reweighted Least Squares: Algorithms, Convergence Analysis, and Numerical Comparisons
- Sparse Reconstruction by Separable Approximation
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Title not available (Why is that?)
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- An EM algorithm for wavelet-based image restoration
- Title not available (Why is that?)
- Regularization Parameter Selection for Nonlinear Iterative Image Restoration and MRI Reconstruction Using GCV and SURE-Based Methods
- Fixed point and Bregman iterative methods for matrix rank minimization
- Computer Vision - ECCV 2004
- Iteratively reweighted least squares minimization for sparse recovery
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- Exploiting residual information in the parameter choice for discrete ill-posed problems
- Atomic decomposition by basis pursuit
- Title not available (Why is that?)
- On the discrepancy principle for some Newton type methods for solving nonlinear inverse problems
- An interior-point method for large-scale \(l_1\)-regularized logistic regression
- A semismooth Newton method for \(\mathrm{L}^1\) data fitting with automatic choice of regularization parameters and noise calibration
- Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
- Heuristic regularization methods for numerical differentiation
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- A duality-based splitting method for \(\ell^1-TV\) image restoration with automatic regularization parameter choice
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
Cited In (7)
- Heuristic Parameter-Choice Rules for Convex Variational Regularization Based on Error Estimates
- Selecting Regularization Parameters for Nuclear Norm--Type Minimization Problems
- High-order lumps, high-order breathers and hybrid solutions for an extended \((3+1)\)-dimensional Jimbo-Miwa equation in fluid dynamics
- On positive solutions for some second-order three-point boundary value problems with convection term
- The convergence of a new heuristic parameter selection criterion for general regularization methods
- New quantum key agreement protocols based on cluster states
- Two-party quantum key agreement over a collective noisy channel
Uses Software
This page was built for publication: A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679565)
