Contact and support
Need help, have a question, or want to contact the ResearchHub team?
© 2026 ResearchHub. Built for responsible scholarly connection.
Privacy-aware community infrastructureResearch graph
References from Optimization with Sparsity-Inducing Penalties. Local targets link to admitted publications; unresolved targets remain external evidence.
A new approach to collaborative filtering: Operator estimation with spectral regularization
External reference
Variable sparsity kernel learning
External reference
K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
10.1109/tsp.2006.881199 · External reference
Uncovering shared structures in multiclass classification
10.1145/1273496.1273499 · External reference
Sparse probabilistic projections
External reference
Convex multi-task feature learning
10.1007/s10994-007-5040-8 · External reference
Consistency of the group lasso and multiple kernel learning
External reference
Consistency of trace norm minimization
External reference
Exploring large feature spaces with hierarchical multiple kernel learning
External reference
Structured sparsity-inducing norms through submodular functions
External reference
Shaping level sets with submodular functions
External reference
Unresolved reference
External reference
Multiple kernel learning, conic duality, and the SMO algorithm
External reference
Convex sparse matrix factorizations
External reference
Model-based compressive sensing
10.1109/tit.2010.2040894 · External reference
Absolute and monotonic norms
10.1007/bf01386026 · External reference
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
10.1137/080716542 · External reference
Unresolved reference
External reference
Simultaneous analysis of Lasso and Dantzig selector
External reference
10.1007/978-0-387-31256-9
10.1007/978-0-387-31256-9 · External reference
Online algorithms and stochastic approximations
External reference
The tradeoffs of large scale learning
External reference
Large scale online learning
External reference
Distributed optimization and statistical learning via the alternating direction method of multipliers
External reference
10.1017/cbo9780511804441
10.1017/cbo9780511804441 · External reference
Convex coding
External reference
An O(n) algorithm for quadratic knapsack problems
10.1016/0167-6377(84)90010-5 · External reference
Dimension reduction: A guided tour
External reference
A singular value thresholding algorithm for matrix completion
10.1137/080738970 · External reference
Enhancing sparsity by reweighted L1 minimization
10.1007/s00041-008-9045-x · External reference
Sparse Bayesian nonparametric regression
10.1145/1390156.1390168 · External reference
Sparse signal recovery using markov random fields
External reference
Total variation minimization and a class of binary MRF models
External reference
On total variation minimization and surface evolution using parametric maximum flows
10.1007/s11263-009-0238-9 · External reference
The convex geometry of linear inverse problems
External reference
Convergence rates in forward-backward splitting
10.1137/s1052623495290179 · External reference
Atomic decomposition by basis pursuit
10.1137/s1064827596304010 · External reference
Unresolved reference
External reference
Signal recovery by proximal forward-backward splitting
External reference
Forward sequential algorithms for best basis selection
10.1049/ip-vis:19990445 · External reference
Iteratively reweighted least squares minimization for sparse recovery
10.1002/cpa.20303 · External reference
Adapting to unknown smoothness via wavelet shrinkage
10.1080/01621459.1995.10476626 · External reference
Adaptive subgradient methods for online learning and stochastic optimization
External reference
Least angle regression
External reference
Image denoising via sparse and redundant representations over learned dictionaries
10.1109/tip.2006.881969 · External reference
Method of optimal directions for frame design
External reference
Variable selection via nonconcave penalized likelihood and its oracle properties
10.1198/016214501753382273 · External reference
A rank minimization heuristic with application to minimum order system approximation
10.1109/acc.2001.945730 · External reference
A note on the group lasso and a sparse group lasso
External reference
Greedy function approximation: a gradient boosting machine
External reference
Penalized regressions: The bridge versus the lasso
10.1080/10618600.1998.10474784 · External reference
Recovering sparse signals with non-convex penalties and DC programming
10.1109/tsp.2009.2026004 · External reference
Large-scale bayesian logistic regression for text categorization
10.1198/004017007000000245 · External reference
10.1137/1.9781611970838
10.1137/1.9781611970838 · External reference
Outcomes of the equivalence of adaptive ridge with least absolute shrinkage
External reference
Compressible distributions for high-dimensional statistics
External reference
Unresolved reference
External reference
Catching change-points with Lasso
External reference
Sparse approximation via iterative thresholding
External reference
Accelerated gradient methods for stochastic optimization and online learning
External reference
The benefit of group sparsity
External reference
Learning with structured sparsity
External reference
Spike and slab variable selection: frequentist and Bayesian strategies
External reference
Group Lasso with overlaps and graph Lasso
External reference
Unresolved reference
External reference
Structured variable selection with sparsity-inducing norms
External reference
Multi-scale mining of fMRI data with hierarchical structured sparsity
External reference
Proximal methods for sparse hierarchical dictionary learning
External reference
Proximal methods for hierarchical sparse coding
External reference
Structured sparse principal component analysis
External reference
Hierarchical clustering schemes
10.1007/bf02289588 · External reference
Learning invariant features through topographic filter maps
External reference
Tree-guided group lasso for multi-task regression with structured sparsity
External reference
Some results on Tchebycheffian spline functions
10.1016/0022-247x(71)90184-3 · External reference
An interior-point method for large-scale l1-regularized logistic regression
External reference
Sparse multinomial logistic regression: Fast algorithms and generalization bounds
10.1109/tpami.2005.127 · External reference
Learning the kernel matrix with semidefinite programming
External reference
A statistical framework for genomic data fusion
10.1093/bioinformatics/bth294 · External reference
Efficient sparse coding algorithms
External reference
Itakura-Saito nonnegative matrix factorization with group sparsity
External reference
Splitting algorithms for the sum of two nonlinear operators
10.1137/0716071 · External reference
Blockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery
External reference
Taking advantage of sparsity in multi-task learning
External reference
A linear-time median-finding algorithm for projecting a vector on the simplex of Rn
10.1016/0167-6377(89)90064-3 · External reference
Unresolved reference
External reference
Online learning for matrix factorization and sparse coding
External reference
Network flow algorithms for structured sparsity
External reference
Convex and network flow optimization for structured sparsity
External reference
Matching pursuit in a time-frequency dictionary
10.1109/78.258082 · External reference
Portfolio selection
External reference
Règularisation d’inèquations variationnelles par approximations successives
External reference
Structured sparsity in structured prediction
External reference
Regularizers for structured sparsity
External reference
Fonctions convexes duales et points proximaux dans un espace hilbertien
External reference
Solving structured sparsity regularization with proximal methods
External reference
Sparse approximate solutions to linear systems
10.1137/s0097539792240406 · External reference
10.1007/978-1-4612-0745-0
10.1007/978-1-4612-0745-0 · External reference
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
10.1016/j.acha.2008.07.002 · External reference
A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
External reference
10.1007/978-1-4419-8853-9
10.1007/978-1-4419-8853-9 · External reference
Smooth minimization of non-smooth functions
10.1007/s10107-004-0552-5 · External reference
Gradient methods for minimizing composite objective function
External reference
Efficiency of coordinate descent methods on huge-scale optimization problems
External reference
Unresolved reference
External reference
Group Lasso with overlaps: the Latent Group Lasso approach
External reference
Joint covariate selection and joint subspace selection for multiple classification problems
External reference
Emergence of simple-cell receptive field properties by learning a sparse code for natural images
10.1038/381607a0 · External reference
On the Lasso and its dual
10.1080/10618600.2000.10474883 · External reference
Multi-task feature learning
External reference
SimpleMKL
External reference
Convex approaches to model wavelet sparsity patterns
External reference
Classification of arrayCGH data using fused SVM
10.1093/bioinformatics/btn188 · External reference
Sparse additive models
10.1111/j.1467-9868.2009.00718.x · External reference
Ein verfahren zur lösung parameterabhängiger, nichtlinearer maximum-probleme
10.1007/bf01920852 · External reference
Unresolved reference
External reference
The Group-Lasso for generalized linear models: uniqueness of solutions and efficient algorithms
10.1145/1390156.1390263 · External reference
Nonlinear total variation based noise removal algorithms
10.1016/0167-2789(92)90242-f · External reference
Fast optimization methods for L1 regularization: A comparative study and two new approaches
External reference
Unresolved reference
External reference
Convergence rates of inexact proximal-gradient methods for convex optimization
External reference
Convex structure learning in log-linear models: Beyond pairwise potentials
External reference
10.7551/mitpress/4175.001.0001
10.7551/mitpress/4175.001.0001 · External reference
Bayesian inference and optimal design for the sparse linear model
External reference
Stochastic methods for l1-regularized loss minimization
External reference
10.1137/1.9780898718751
10.1137/1.9780898718751 · External reference
10.1017/cbo9780511809682
10.1017/cbo9780511809682 · External reference
A simple and efficient algorithm for gene selection using sparse logistic regression
10.1093/bioinformatics/btg308 · External reference
Large scale multiple kernel learning
External reference
C-HiLasso: A collaborative hierarchical sparse modeling framework
10.1109/tsp.2011.2157912 · External reference
Maximum-margin matrix factorization
External reference
SpicyMKL: A fast algorithm for multiple kernel learning with thousands of kernels
10.1007/s10994-011-5252-9 · External reference
Hierarchical penalization
External reference
Regression shrinkage and selection via the Lasso
10.1111/j.2517-6161.1996.tb02080.x · External reference
Sparsity and smoothness via the fused Lasso
10.1111/j.1467-9868.2005.00490.x · External reference
Unresolved reference
External reference
Greed is good: Algorithmic results for sparse approximation
External reference
Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit
External reference
Applications of a splitting algorithm to decomposition in convex programming and variational inequalities
10.1137/0329006 · External reference
On accelerated proximal gradient methods for convex-concave optimization
External reference
A coordinate gradient descent method for nonsmooth separable minimization
10.1007/s10107-007-0170-0 · External reference
Simultaneous variable selection
10.1198/004017005000000139 · External reference
Group sparsity via linear-time projections
External reference
Sparse structured dictionary learning for brain resting-state activity modeling
External reference
Fast detection of multiple change-points shared by many signals using group LARS
External reference
Sharp thresholds for noisy and high-dimensional recovery of sparsity using l1-constrained quadratic programming
10.1109/tit.2009.2016018 · External reference
Unresolved reference
External reference
A new view of automatic relevance determination
External reference
Sparse bayesian learning for basis selection
External reference
Robust face recognition via sparse representation
10.1109/tpami.2008.79 · External reference
Accelerated block-coordinate relaxation for regularized optimization
External reference
Sparse reconstruction by separable approximation
10.1109/tsp.2009.2016892 · External reference
Coordinate descent algorithms for lasso penalized regression
External reference
Dual averaging methods for regularized stochastic learning and online optimization
External reference
Robust PCA via outlier pursuit
External reference
A comparison of optimization methods for large-scale l1-regularized linear classification
External reference
Model selection and estimation in regression with grouped variables
10.1111/j.1467-9868.2005.00532.x · External reference
The composite absolute penalties family for grouped and hierarchical variable selection
External reference
On model selection consistency of Lasso
External reference
Regularization and variable selection via the elastic net
10.1111/j.1467-9868.2005.00503.x · External reference
