Majorization minimization by coordinate descent for concave penalized generalized linear models (Q746337): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: R / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: sparsenet / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: glmnet / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033932347 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q41843162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of quadratic-approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal spatial adaptation by wavelet shrinkage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least angle regression. (With discussion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwise coordinate optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable selection using MM algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majorization-minimization algorithms for nonsmoothly penalized objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>SparseNet</i>: Coordinate Descent With Nonconvex Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to variable selection in least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a block coordinate descent method for nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Certain Convex Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms for lasso penalized regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly unbiased variable selection under minimax concave penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-step sparse estimates in nonconcave penalized likelihood models / rank
 
Normal rank

Latest revision as of 21:33, 10 July 2024

scientific article
Language Label Description Also known as
English
Majorization minimization by coordinate descent for concave penalized generalized linear models
scientific article

    Statements

    Majorization minimization by coordinate descent for concave penalized generalized linear models (English)
    0 references
    0 references
    0 references
    16 October 2015
    0 references
    logistic regression
    0 references
    \(p\gg n\) models
    0 references
    smoothly clipped absolute deviation penalty
    0 references
    minimax concave penalty
    0 references
    variable selection
    0 references
    0 references
    0 references
    0 references

    Identifiers