One-step sparse ridge estimation with folded concave penalty

No abstract is available for this paper.

• Publication year

  2024

• Venue

  Mathematical Foundations of Computing

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.3934/mfc.2022048
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Variable Selection

  2019cited by this paper
• Variable selection for high-dimensional generalized linear models with the weighted elastic-net procedure

  2015cited by this paper
• Group variable selection via SCAD-L2

  2014cited by this paper
• SparseNet: Coordinate Descent With Nonconvex Penalties

  2011cited by this paper
• Variable selection via combined penalization for high-dimensional data analysis

  2010cited by this paper
• Tuning parameter selectors for the smoothly clipped absolute deviation method.

  2007cited by this paper
• The Adaptive Lasso and Its Oracle Properties

  2006cited by this paper
• High-dimensional graphs and variable selection with the Lasso

  2006cited by this paper
• Variable Selection using MM Algorithms.

  2005cited by this paper
• Nonconcave penalized likelihood with a diverging number of parameters

  2004cited by this paper
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

  2001cited by this paper
• Optimization Transfer Using Surrogate Objective Functions

  2000cited by this paper
• Regression Shrinkage and Selection via the Lasso

  1996cited by this paper
• © Institute of Mathematical Statistics, 2004 LEAST ANGLE REGRESSION

  year unknowncited by this paper

• Sparse Tensor CCA via Manifold Optimization for Multi-View Learning

  2025cites this paper
• A powerful penalized multinomial logistic regression approach

  2025cites this paper