scientific article; zbMATH DE number 7626751
From MaRDI portal
Publication:5053252
Cites work
- A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation
- A coordinate gradient descent method for nonsmooth separable minimization
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Algorithm of spectral super-resolution of hyperspectral imagery based on redundant dictionary
- Algorithms for nonnegative matrix factorization with the -divergence
- Archetypal Analysis
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex analysis and nonlinear optimization. Theory and examples
- Dual extrapolation for sparse GLMs
- Dynamic Screening: Accelerating First-Order Algorithms for the Lasso and Group-Lasso
- Euclidean embedding of co-occurrence data
- Gap safe screening rules for sparsity enforcing penalties
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 7626751 (Why is no real title available?)
- Lasso screening rules via dual polytope projection
- Learning the parts of objects by non-negative matrix factorization
- Nonlinear Hyperspectral Unmixing With Robust Nonnegative Matrix Factorization
- Optimization with sparsity-inducing penalties
- Robust and efficient estimation by minimising a density power divergence
- Safe Feature Elimination in Sparse Supervised Learning
- Safe triplet screening for distance metric learning
- Stable Safe Screening and Structured Dictionaries for Faster $\ell _{1}$ Regularization
- Statistics for high-dimensional data. Methods, theory and applications.
- Strong Rules for Discarding Predictors in Lasso-Type Problems
- Sure independence screening for ultrahigh dimensional feature space. With discussion and authors' reply
- This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice
- Two-layer feature reduction for sparse-group Lasso via decomposition of convex sets
Cited in
(5)- scientific article; zbMATH DE number 7626751 (Why is no real title available?)
- Safe Rules for the Identification of Zeros in the Solutions of the SLOPE Problem
- High-Dimensional Portfolio Selection with Cardinality Constraints
- Expanding boundaries of Gap Safe screening
- Safe feature identification rule for fused Lasso by an extra dual variable
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 Q5053252)
