Adaptive sieving: a dimension reduction technique for sparse optimization problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A highly efficient algorithm for solving exclusive lasso problems
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
- A proximal-proximal majorization-minimization algorithm for nonconvex rank regression problems
- A unified approach to error bounds for structured convex optimization problems
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization
- Composite difference-MAX programs for modern statistical estimation problems
- Convex Analysis
- Dual coordinate ascent methods for non-strictly convex minimization
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization
- Hybrid safe-strong rules for efficient optimization in Lasso-type problems
- Lasso screening rules via dual polytope projection
- Model Selection and Estimation in Regression with Grouped Variables
- Monotone Operators and the Proximal Point Algorithm
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Regularization and Variable Selection Via the Elastic Net
- Robust Recovery of Signals From a Structured Union of Subspaces
- SLOPE-adaptive variable selection via convex optimization
- Safe Feature Elimination in Sparse Supervised Learning
- Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method
- Sparse regression using mixed norms
- Strong Rules for Discarding Predictors in Lasso-Type Problems
- Sure independence screening for ultrahigh dimensional feature space. With discussion and authors' reply
- Within group variable selection through the exclusive Lasso
This page was built for publication: Adaptive sieving: a dimension reduction technique for sparse optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912330)
