Cited in
(53)- On efficiently solving the subproblems of a level-set method for fused lasso problems
- Local image tagging via graph regularized joint group sparsity
- Modular proximal optimization for multidimensional total-variation regularization
- A fast unified algorithm for solving group-lasso penalize learning problems
- Sparse Approximation via Penalty Decomposition Methods
- Double fused Lasso regularized regression with both matrix and vector valued predictors
- A modified proximal gradient method for a family of nonsmooth convex optimization problems
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- scientific article; zbMATH DE number 6378171 (Why is no real title available?)
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- Spectral regularization algorithms for learning large incomplete matrices
- Graph optimization for dimensionality reduction with sparsity constraints
- Robust sparse coding via self-paced learning for data representation
- A link-free sparse group variable selection method for single-index model
- Efficient block-coordinate descent algorithms for the group Lasso
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- Linearized alternating direction method of multipliers for sparse group and fused Lasso models
- Fast projections onto mixed-norm balls with applications
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- sparseLDA
- Yall1
- na28
- gglasso
- MALSAR
- SMT: Sparse multivariate tree
- Least absolute deviations learning of multiple tasks
- biglasso
- C-HiLasso
- scalreg
- msgl
- breastCancerNKI
- LZeroSpikeInference
- Convex optimization for group feature selection in networked data
- On the proximal Landweber Newton method for a class of nonsmooth convex problems
- gCol
- Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression
- loggle
- condat_tv
- Bayesian indicator variable selection to incorporate hierarchical overlapping group structure in multi-omics applications
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
- Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee
- Low-rank and sparse multi-task learning
- Irregular N2SLS and Lasso estimation of the matrix exponential spatial specification model
- Link prediction via sparse Gaussian graphical model
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
- Split Bregman algorithms for sparse group lasso with application to MRI reconstruction
- Split Bregman algorithms for multiple measurement vector problem
- Lasso screening rules via dual polytope projection
- Directional sparsity in optimal control of partial differential equations
- LARS-type algorithm for group Lasso
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
- Efficient nonconvex sparse group feature selection via continuous and discrete optimization
- Regularization-based model tree for multi-output regression
This page was built for software: SLEP
