\texttt{skscope}: fast sparsity-constrained optimization in Python
From MaRDI portal
Publication:6638539
Recommendations
Cites work
- A polynomial algorithm for best-subset selection problem
- A tight bound of hard thresholding
- Automatic differentiation: techniques and applications
- CVXPY: a Python-embedded modeling language for convex optimization
- Dual iterative hard thresholding
- Global and quadratic convergence of Newton hard-thresholding pursuit
- Greedy sparsity-constrained optimization
- Hard thresholding pursuit: an algorithm for compressive sensing
- High-Dimensional Feature Selection by Feature-Wise Kernelized Lasso
- scientific article; zbMATH DE number 6982909 (Why is no real title available?)
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Robust Variable Selection With Exponential Squared Loss
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- ℓ0 Trend Filtering
This page was built for publication: \texttt{skscope}: fast sparsity-constrained optimization in Python
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638539)