Skip to Main content Skip to Navigation
Journal articles

A mixture of local and quadratic approximation variable selection algorithm in nonconcave penalized regression

Abstract : We consider the problem of variable selection via penalized likelihood using nonconvex penalty functions. To maximize the non-differentiable and nonconcave objective function, an algorithm based on local linear approximation and which adopts a naturally sparse representation was recently proposed. However, although it has promising theoretical properties, it inherits some drawbacks of Lasso in high dimensional setting. To overcome these drawbacks, we propose an algorithm (MLLQA) for maximizing the penalized likelihood for a large class of nonconvex penalty functions. The convergence property of MLLQA and oracle property of one-step MLLQA estimator are established. Some simulations and application to a real data set are also presented.
Document type :
Journal articles
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-01299521
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, April 7, 2016 - 5:28:47 PM
Last modification on : Wednesday, October 30, 2019 - 4:34:07 PM
Long-term archiving on: : Monday, November 14, 2016 - 9:34:52 PM

File

Vol.16.pp.29-46.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01299521, version 1

Collections

Citation

Assi N'Guessan, Ibrahim Sidi Zakari, Assi Mkhadri. A mixture of local and quadratic approximation variable selection algorithm in nonconcave penalized regression. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2013, 16, pp.29-46. ⟨hal-01299521⟩

Share

Metrics

Record views

178

Files downloads

1488