scientific article; zbMATH DE number 6982922
From MaRDI portal
Publication:4558490
Recommendations
- \({A^\dag}\) graded hard thresholding pursuit algorithm
- Iterative projection gradient hard thresholding pursuit algorithm for sparse optimization
- Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- Hard thresholding pursuit with continuation for \(\ell^{0}\)-regularized minimizations
- Hard thresholding pursuit algorithms: number of iterations
- scientific article; zbMATH DE number 6765495
- Hard thresholding pursuit: an algorithm for compressive sensing
- Dual iterative hard thresholding
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- Hard thresholding regression
Cites work
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A modified finite Newton method for fast solution of large scale linear SVMs
- Alternating direction method for covariance selection models
- Compressed sensing
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Fast global convergence of gradient methods for high-dimensional statistical recovery
- Graphical models, exponential families, and variational inference
- Greedy sparsity-constrained optimization
- Hard thresholding pursuit: an algorithm for compressive sensing
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Introduction to Graphical Modelling
- Introductory lectures on convex optimization. A basic course.
- Iterative hard thresholding for compressed sensing
- Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
- Matching pursuits with time-frequency dictionaries
- On the conditions used to prove oracle results for the Lasso
- Pattern recognition and machine learning.
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Smooth Optimization Approach for Sparse Covariance Selection
- Sparse Approximate Solutions to Linear Systems
- Sparse inverse covariance estimation with the graphical lasso
- Sparse online learning via truncated gradient
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Stable signal recovery from incomplete and inaccurate measurements
- Trading accuracy for sparsity in optimization problems with sparsity constraints
- Truncated power method for sparse eigenvalue problems
Cited in
(29)- Weighted thresholding homotopy method for sparsity constrained optimization
- A Lagrange-Newton algorithm for sparse nonlinear programming
- GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee
- A data-driven line search rule for support recovery in high-dimensional data analysis
- Gradient projection Newton pursuit for sparsity constrained optimization
- Optimality conditions for rank-constrained matrix optimization
- Newton method for \(\ell_0\)-regularized optimization
- A primal and dual active set algorithm for truncated \(L_1\) regularized logistic regression
- scientific article; zbMATH DE number 6982301 (Why is no real title available?)
- A tight bound of hard thresholding
- \({A^\dag}\) graded hard thresholding pursuit algorithm
- On the Solution of ℓ0-Constrained Sparse Inverse Covariance Estimation Problems
- Global and quadratic convergence of Newton hard-thresholding pursuit
- An equivalence between critical points for rank constraints versus low-rank factorizations
- Dual iterative hard thresholding
- Iterative projection gradient hard thresholding pursuit algorithm for sparse optimization
- Greedy sparsity-constrained optimization
- Cardinality-constrained structured data-fitting problems
- Cardinality minimization, constraints, and regularization: a survey
- Subspace Newton method for sparse group \(\ell_0\) optimization problem
- A Lagrange–Newton algorithm for tensor sparse principal component analysis
- Constrained mix sparse optimization via hard thresholding pursuit
- Relaxation quadratic approximation greedy pursuit method based on sparse learning
- Exact recovery in the double sparse model: sufficient and necessary signal conditions
- Robust decoding from binary measurements with cardinality constraint least squares
- A communication-efficient method for generalized linear regression with ℓ 0 regularization
- Iterative mix thresholding algorithm with continuation technique for mix sparse optimization and application
- Heavy-ball-based relaxed optimal \(\mathrm{s}\)-thresholding algorithms for solving compressed sensing problem
- Accelerated nonnegative proximal gradient algorithm for sparse linear complementarity problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558490)
