The following pages link to SLEP (Q25401):
Displaying 39 items.
- Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee (Q331671) (← links)
- Split Bregman algorithms for sparse group lasso with application to MRI reconstruction (Q335981) (← links)
- Split Bregman algorithms for multiple measurement vector problem (Q336036) (← links)
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems (Q457540) (← links)
- Graph optimization for dimensionality reduction with sparsity constraints (Q650966) (← links)
- Efficient nonconvex sparse group feature selection via continuous and discrete optimization (Q892230) (← links)
- Linearized alternating direction method of multipliers for sparse group and fused Lasso models (Q1623671) (← links)
- A modified proximal gradient method for a family of nonsmooth convex optimization problems (Q1697903) (← links)
- LARS-type algorithm for group Lasso (Q1703818) (← links)
- Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression (Q1713210) (← links)
- Least absolute deviations learning of multiple tasks (Q1716982) (← links)
- Irregular N2SLS and Lasso estimation of the matrix exponential spatial specification model (Q1792447) (← links)
- Link prediction via sparse Gaussian graphical model (Q1793509) (← links)
- Fast projections onto mixed-norm balls with applications (Q1944995) (← links)
- Local image tagging via graph regularized joint group sparsity (Q1951254) (← links)
- Regularization-based model tree for multi-output regression (Q1999021) (← links)
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets (Q2033090) (← links)
- Double fused Lasso regularized regression with both matrix and vector valued predictors (Q2044365) (← links)
- Robust sparse coding via self-paced learning for data representation (Q2055547) (← links)
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems (Q2288192) (← links)
- Bayesian indicator variable selection to incorporate hierarchical overlapping group structure in multi-omics applications (Q2291545) (← links)
- On the proximal Landweber Newton method for a class of nonsmooth convex problems (Q2340491) (← links)
- Efficient block-coordinate descent algorithms for the group Lasso (Q2392933) (← links)
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm (Q2442634) (← links)
- (Q2896145) (← links)
- Directional Sparsity in Optimal Control of Partial Differential Equations (Q2903512) (← links)
- (Q2934136) (← links)
- Low-Rank and Sparse Multi-task Learning (Q3449323) (← links)
- On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems (Q4571884) (← links)
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems (Q4606653) (← links)
- Modular proximal optimization for multidimensional total-variation regularization (Q4614088) (← links)
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization (Q4911905) (← links)
- SMT: Sparse multivariate tree (Q4969925) (← links)
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer (Q5072590) (← links)
- A link-free sparse group variable selection method for single-index model (Q5138715) (← links)
- Convex Optimization for Group Feature Selection in Networked Data (Q5139860) (← links)
- Sparse Approximation via Penalty Decomposition Methods (Q5408227) (← links)
- (Q5744796) (← links)
- A fast unified algorithm for solving group-lasso penalize learning problems (Q5963816) (← links)
