A pseudo-heuristic parameter selection rule for l^1-regularized minimization problems
From MaRDI portal
(Redirected from Publication:679565)
A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
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
Cites work
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 1943005 (Why is no real title available?)
- scientific article; zbMATH DE number 1376935 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A duality-based splitting method for \(\ell^1-TV\) image restoration with automatic regularization parameter choice
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A practical guide to splines
- A semismooth Newton method for \(\mathrm{L}^1\) data fitting with automatic choice of regularization parameters and noise calibration
- An EM algorithm for wavelet-based image restoration
- An interior-point method for large-scale \(l_1\)-regularized logistic regression
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Atomic decomposition by basis pursuit
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Computer Vision - ECCV 2004
- Estimation of the mean of a multivariate normal distribution
- Exploiting residual information in the parameter choice for discrete ill-posed problems
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- Fixed point and Bregman iterative methods for matrix rank minimization
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Gradient methods for minimizing composite functions
- Heuristic regularization methods for numerical differentiation
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Iteratively Reweighted Least Squares: Algorithms, Convergence Analysis, and Numerical Comparisons
- Iteratively reweighted least squares minimization for sparse recovery
- Least angle regression. (With discussion)
- On the discrepancy principle for some Newton type methods for solving nonlinear inverse problems
- Probing the Pareto frontier for basis pursuit solutions
- Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
- Regularization Parameter Selection for Nonlinear Iterative Image Restoration and MRI Reconstruction Using GCV and SURE-Based Methods
- Shrinkage tuning parameter selection with a diverging number of parameters
- Sparse Reconstruction by Separable Approximation
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
Cited in
(7)- The convergence of a new heuristic parameter selection criterion for general regularization methods
- High-order lumps, high-order breathers and hybrid solutions for an extended \((3+1)\)-dimensional Jimbo-Miwa equation in fluid dynamics
- New quantum key agreement protocols based on cluster states
- Two-party quantum key agreement over a collective noisy channel
- On positive solutions for some second-order three-point boundary value problems with convection term
- Heuristic Parameter-Choice Rules for Convex Variational Regularization Based on Error Estimates
- Selecting Regularization Parameters for Nuclear Norm--Type Minimization Problems
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)
