scientific article; zbMATH DE number 7306858
From MaRDI portal
Publication:5148934
Dimitris Metaxas, Xiaotong Yuan, Bo Liu, Lezi Wang, Qingshan Liu
Publication date: 5 February 2021
Full work available at URL: https://jmlr.csail.mit.edu/papers/v21/18-487.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative hard thresholding for compressed sensing
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- Introductory lectures on convex optimization. A basic course.
- A first-order primal-dual algorithm for convex problems with applications to imaging
- The graphical lasso: new insights and alternatives
- Learning using privileged information: SVM+ and weighted SVM
- Approximate duality
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Optimization with Sparsity-Inducing Penalties
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- A Tight Bound of Hard Thresholding
- Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
- Fast Algorithms for Demixing Sparse Signals From Nonlinear Observations
- DSCOVR: Randomized Primal-Dual Block Coordinate Algorithms for Asynchronous Distributed Optimization
- Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization
- Sparse Approximate Solutions to Linear Systems
- Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
- Greedy Sparsity-Constrained Optimization
- Compressed sensing
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
