A Barzilai-Borwein-like iterative half thresholding algorithm for the L₁/2 regularized problem
From MaRDI portal
Publication:292553
Recommendations
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- Iterative thresholding algorithm based on non-convex method for modified l_p-norm regularization minimization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- An iterative thresholding-like algorithm for inverse problems with sparsity constraints in Banach space
- A new linear convergence result for the iterative soft thresholding algorithm
- A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization
- The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\)
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Iterative thresholding for sparse approximations
- On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
Cites work
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Nonmonotone Line Search Technique for Newton’s Method
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
- A gradient based method for the \(L_{2}-L_{1/2}\) minimization and application to compressive sensing
- A new analysis on the Barzilai-Borwein gradient method
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Gradient-based methods for sparse recovery
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Signal Recovery by Proximal Forward-Backward Splitting
- Sparse Reconstruction by Separable Approximation
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
Cited in
(8)- A residual-based algorithm for solving a class of structured nonsmooth optimization problems
- Manifold optimization-based analysis dictionary learning with an \(\ell_{1/2}\)-norm regularizer
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- Fast L1-L2 minimization via a proximal operator
- A reduced half thresholding algorithm
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
- Optimality conditions for the \(L_{1/2}\) regularization problem and a descent method
- Minimization of \(L_1\) over \(L_2\) for sparse signal recovery with convergence guarantee
This page was built for publication: A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q292553)
