Dual iterative hard thresholding

MaRDI QIDQ5148934zbMATH OpenFDO

Authors Xiao-Tong Yuan, Bo Liu, Lezi Wang, Qingshan Liu, Dimitris Metaxas

Publication date 5 February 2021

Full work available at URL https://jmlr.csail.mit.edu/papers/v21/18-487.html

zbMATH Keywords

duality theoryiterative hard thresholdingnon-convex optimizationsparsity recovery

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A convergent iterative hard thresholding for nonnegative sparsity optimization
• scientific article; zbMATH DE number 6982922
• A note on the complexity of proximal iterative hard thresholding algorithm
• Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
• Between hard and soft thresholding: optimal iterative thresholding algorithms

Cites work

• A first-order primal-dual algorithm for convex problems with applications to imaging
• A tight bound of hard thresholding
• Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
• Approximate duality
• Compressed sensing
• Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
• DSCOVR: randomized primal-dual block coordinate algorithms for asynchronous distributed optimization
• Dual averaging methods for regularized stochastic learning and online optimization
• Fast Algorithms for Demixing Sparse Signals From Nonlinear Observations
• Greedy sparsity-constrained optimization
• Hard thresholding pursuit: an algorithm for compressive sensing
• scientific article; zbMATH DE number 6982922 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 6438182 (Why is no real title available?)
• Introductory lectures on convex optimization. A basic course.
• Iterative hard thresholding for compressed sensing
• Learning using privileged information: SVM+ and weighted SVM
• Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
• Optimization with sparsity-inducing penalties
• Sparse Approximate Solutions to Linear Systems
• Sparsity constrained nonlinear optimization: optimality conditions and algorithms
• Stochastic dual coordinate ascent methods for regularized loss minimization
• Stochastic primal-dual coordinate method for regularized empirical risk minimization
• The graphical lasso: new insights and alternatives
• The sparsity and bias of the LASSO selection in high-dimensional linear regression

Cited in

(3)

• scientific article; zbMATH DE number 6982922 (Why is no real title available?)
• Cardinality-constrained structured data-fitting problems
• \texttt{skscope}: fast sparsity-constrained optimization in Python

Describes a project that uses

Uses Software

• DSCOVR
• RCV1

This page was built for publication: Dual iterative hard thresholding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148934)