Pages that link to "Item:Q1927082"

The following pages link to An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors (Q1927082):

Displaying 17 items.

• Entropy function-based algorithms for solving a class of nonconvex minimization problems (Q259115) (← links)
• The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467) (← links)
• Optimal computational and statistical rates of convergence for sparse nonconvex learning problems (Q482875) (← links)
• Joint variable and rank selection for parsimonious estimation of high-dimensional matrices (Q741790) (← links)
• Generalized co-sparse factor regression (Q830453) (← links)
• Studies of the adaptive network-constrained linear regression and its application (Q1663145) (← links)
• Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework (Q1712546) (← links)
• The 3rd special issue on optimization heuristics in estimation and modelling problems (Q1927079) (← links)
• Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning (Q2073715) (← links)
• Order selection for regression-based hidden Markov model (Q2079607) (← links)
• Robust alternating low-rank representation by joint \(L_p\)- and \(L_{2,p}\)-norm minimization (Q2179083) (← links)
• Weighted nuclear norm minimization and its applications to low level vision (Q2193874) (← links)
• Flexible, boundary adapted, nonparametric methods for the estimation of univariate piecewise-smooth functions (Q2293678) (← links)
• A group VISA algorithm for variable selection (Q2353367) (← links)
• On Cross-Validation for Sparse Reduced Rank Regression (Q3120104) (← links)
• Group sparse recovery via group square-root elastic net and the iterative multivariate thresholding-based algorithm (Q6065672) (← links)
• High-dimensional functional graphical model structure learning via neighborhood selection approach (Q6200903) (← links)