Pages that link to "Item:Q2482976"
From MaRDI portal
The following pages link to Coordinate descent algorithms for lasso penalized regression (Q2482976):
Displayed 50 items.
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection (Q58075) (← links)
- The group exponential lasso for bi-level variable selection (Q123390) (← links)
- Robust and sparse multigroup classification by the optimal scoring approach (Q127301) (← links)
- Penalized Estimation of Directed Acyclic Graphs From Discrete Data (Q139756) (← links)
- A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191) (← links)
- Model selection for factorial Gaussian graphical models with an application to dynamic regulatory networks (Q306638) (← links)
- Sparse factor model for co-expression networks with an application using prior biological knowledge (Q306641) (← links)
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
- Regularized 3D functional regression for brain image data via Haar wavelets (Q400650) (← links)
- Group coordinate descent algorithms for nonconvex penalized regression (Q425386) (← links)
- Coordinate ascent for penalized semiparametric regression on high-dimensional panel count data (Q429611) (← links)
- Smoothing proximal gradient method for general structured sparse regression (Q439167) (← links)
- Regularization for Cox's proportional hazards model with NP-dimensionality (Q449987) (← links)
- A fast procedure for calculating importance weights in bootstrap sampling (Q452522) (← links)
- High-dimensional Cox regression analysis in genetic studies with censored survival outcomes (Q454771) (← links)
- Solution path clustering with adaptive concave penalty (Q457964) (← links)
- SCAD penalized rank regression with a diverging number of parameters (Q476249) (← links)
- SICA for Cox's proportional hazards model with a diverging number of parameters (Q477528) (← links)
- Selecting massive variables using an iterated conditional modes/medians algorithm (Q491389) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- MLSLR: multilabel learning via sparse logistic regression (Q507663) (← links)
- Multicategory vertex discriminant analysis for high-dimensional data (Q542928) (← links)
- Reconstructing DNA copy number by penalized estimation and imputation (Q542936) (← links)
- Variable selection and regression analysis for graph-structured covariates with an application to genomics (Q614169) (← links)
- A majorization-minimization approach to variable selection using spike and slab priors (Q638812) (← links)
- The sparse Laplacian shrinkage estimator for high-dimensional regression (Q651021) (← links)
- Nonconcave penalized composite conditional likelihood estimation of sparse Ising models (Q693730) (← links)
- New cyclic sparsity measures for deconvolution based on convex relaxation (Q736973) (← links)
- APPLE: approximate path for penalized likelihood estimators (Q746326) (← links)
- Majorization minimization by coordinate descent for concave penalized generalized linear models (Q746337) (← links)
- Hybrid safe-strong rules for efficient optimization in Lasso-type problems (Q830584) (← links)
- A scalable surrogate \(L_0\) sparse regression method for generalized linear models with applications to large scale data (Q830734) (← links)
- Coordinate descent algorithm for covariance graphical Lasso (Q892800) (← links)
- A classification-oriented dictionary learning model: explicitly learning the particularity and commonality across categories (Q898347) (← links)
- Gene selection and prediction for cancer classification using support vector machines with a reject option (Q901576) (← links)
- Linearized alternating direction method of multipliers for sparse group and fused Lasso models (Q1623671) (← links)
- A globally convergent algorithm for Lasso-penalized mixture of linear regression models (Q1662084) (← links)
- Sparse principal component regression for generalized linear models (Q1662867) (← links)
- Studies of the adaptive network-constrained linear regression and its application (Q1663145) (← links)
- The dual and degrees of freedom of linearly constrained generalized Lasso (Q1663318) (← links)
- Variable selection and estimation using a continuous approximation to the \(L_0\) penalty (Q1695760) (← links)
- Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression (Q1713210) (← links)
- Efficient LED-SAC sparse estimator using fast sequential adaptive coordinate-wise optimization (LED-2SAC) (Q1718121) (← links)
- Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
- Simultaneous estimation of quantile regression functions using B-splines and total variation penalty (Q1727908) (← links)
- Sparse least trimmed squares regression for analyzing high-dimensional large data sets (Q1951528) (← links)
- Inferring sparse Gaussian graphical models with latent structure (Q1951974) (← links)
- Thresholding-based iterative selection procedures for model selection and shrinkage (Q1951984) (← links)
- Sparse regression with exact clustering (Q1952092) (← links)
- Majorization-minimization algorithms for nonsmoothly penalized objective functions (Q1952099) (← links)