Iterative positive thresholding algorithm for non-negative sparse optimization

DOI10.1080/02331934.2018.1470629zbMath1412.90163OpenAlexW2804990778MaRDI QIDQ4559400

Lufang Zhang, Yao-Hua Hu, Carisa Kwok Wai Yu, Jin-Hua Wang

Publication date: 3 December 2018

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2018.1470629

zbMATH Keywords

global convergencelinear convergence rateiterative positive thresholding algorithmnon-negative \(\ell_1\) regularization problemsnon-negative sparse optimization

Mathematics Subject Classification ID

Programming in abstract spaces (90C48)

Related Items

Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems ⋮ Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Gradient methods for minimizing composite functions
• Sparse solutions to random standard quadratic optimization problems
• On the complexity analysis of randomized block-coordinate descent methods
• Linear convergence of iterative soft-thresholding
• An improved algorithm for the \(L_2-L_p\) minimization problem
• \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
• Nonlinear solution of linear inverse problems by wavelet-vaguelette decomposition
• Global uniqueness for a two-dimensional inverse boundary value problem
• Atomic Decomposition by Basis Pursuit
• On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
• A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Local Linear Convergence of ISTA and FISTA on the LASSO Problem
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• An EM algorithm for wavelet-based image restoration
• Decoding by Linear Programming
• Greed is Good: Algorithmic Results for Sparse Approximation
• Sparse and Redundant Representations
• On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
• The Interior Radon Transform
• Monotone Operators and the Proximal Point Algorithm
• Sparse Recovery of Nonnegative Signals With Minimal Expansion
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• A new linear convergence result for the iterative soft thresholding algorithm
• Sparse nonnegative solution of underdetermined linear equations by linear programming
• On the Non-Negative Garrotte Estimator
• Signal Recovery by Proximal Forward-Backward Splitting
• Convex analysis and monotone operator theory in Hilbert spaces
• Compressed sensing
• Structured sparsity through convex optimization

This page was built for publication: Iterative positive thresholding algorithm for non-negative sparse optimization