SLEP

swMATH13487MaRDI QIDQ25401FDOQ25401

Author name not available (Why is that?)

Source code repository: https://github.com/jiayuzhou/SLEP

Cited In (39)

• SMT: Sparse multivariate tree
• Low-Rank and Sparse Multi-task Learning
• Sparse Approximation via Penalty Decomposition Methods
• Regularization-based model tree for multi-output regression
• Spectral regularization algorithms for learning large incomplete matrices
• On the proximal Landweber Newton method for a class of nonsmooth convex problems
• Double fused Lasso regularized regression with both matrix and vector valued predictors
• Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression
• Directional sparsity in optimal control of partial differential equations
• Modular proximal optimization for multidimensional total-variation regularization
• A link-free sparse group variable selection method for single-index model
• An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
• Graph optimization for dimensionality reduction with sparsity constraints
• On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
• An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
• Efficient nonconvex sparse group feature selection via continuous and discrete optimization
• Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee
• Irregular N2SLS and Lasso estimation of the matrix exponential spatial specification model
• Link prediction via sparse Gaussian graphical model
• Split Bregman algorithms for sparse group lasso with application to MRI reconstruction
• Split Bregman algorithms for multiple measurement vector problem
• Robust sparse coding via self-paced learning for data representation
• Local image tagging via graph regularized joint group sparsity
• A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
• On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
• On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems
• Fast projections onto mixed-norm balls with applications
• Bayesian indicator variable selection to incorporate hierarchical overlapping group structure in multi-omics applications
• A fast unified algorithm for solving group-lasso penalize learning problems
• A modified proximal gradient method for a family of nonsmooth convex optimization problems
• Efficient block-coordinate descent algorithms for the group Lasso
• Linearized alternating direction method of multipliers for sparse group and fused Lasso models
• LARS-type algorithm for group Lasso
• A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• Least absolute deviations learning of multiple tasks
• Convex Optimization for Group Feature Selection in Networked Data

This page was built for software: SLEP