GAITA: a Gauss-Seidel iterative thresholding algorithm for _q regularized least squares regression
DOI10.1016/J.CAM.2017.01.010zbMATH Open1361.65041OpenAlexW2963737870MaRDI QIDQ515771FDOQ515771
Authors: Jinshan Zeng, Zhimin Peng, Shaobo Lin 
Publication date: 16 March 2017
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.01.010
Recommendations
- A new linear convergence result for the iterative soft thresholding algorithm
- A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares
- An iteratively reweighted least squares algorithm for sparse regularization
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- Gauss-Seidal algorithm to \(L_1\) minimization
machine learningsignal processingglobal convergencenumerical experimentsiterative thresholding algorithmJacobi\(\ell_q\) regularized least squaresGauss-Seidel
Numerical mathematical programming methods (65K05) Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Cites Work
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Model-free feature screening for ultrahigh-dimensional data
- SparseNet: coordinate descent with nonconvex penalties
- Pathwise coordinate optimization
- Title not available (Why is that?)
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- A coordinate gradient descent method for nonsmooth separable minimization
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Smoothing methods for nonsmooth, nonconvex minimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Restricted isometry properties and nonconvex compressive sensing
- Iteratively reweighted least squares minimization for sparse recovery
- Iterative Solution of Nonlinear Equations in Several Variables
- Iterative thresholding for sparse approximations
- Globally convergent block-coordinate techniques for unconstrained optimization
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- On the convergence of block coordinate descent type methods
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- Subgradient method for nonconvex nonsmooth optimization
- Sparse SAR imaging based on \(L_{1/2}\) regularization
- On the convergence of the coordinate descent method for convex differentiable minimization
- Coordinate-friendly structures, algorithms and applications
- Research on quantum authentication methods for the secure access control among three elements of cloud computing
- $l_{q}$ Sparsity Penalized Linear Regression With Cyclic Descent
- Linear convergence of adaptively iterative thresholding algorithms for compressed sensing
- A comparison of Jacobi and Gauss-Seidel parallel iterations
Cited In (4)
- Global convergence of ADMM in nonconvex nonsmooth optimization
- A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares
- Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
- Run-and-inspect method for nonconvex optimization and global optimality bounds for R-local minimizers
Uses Software
This page was built for publication: GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515771)
