A note on “Reguralizers for structured sparsity”

F. Lara

doi:10.1007/s10444-017-9583-3

A note on “Reguralizers for structured sparsity”

F. Lara

Instituto de Alta Investigación

Producción científica: Contribución a una revista › Artículo › revisión exhaustiva

1 Cita (Scopus)

Resumen

In this note, the notion of admissible sets contained in the strictly positive orthant introduced in Micchelli et al. (Adv. Comp. Math. 38(3), 455–489 2013) is analyzed. This notion was used to generalize theoretical results and optimization methods for structured sparsity. Unfortunately, we will prove that there is no generalization using admissible sets.

Idioma original	Inglés
Páginas (desde-hasta)	1321-1323
Número de páginas	3
Publicación	Advances in Computational Mathematics
Volumen	44
N.º	4
DOI	https://doi.org/10.1007/s10444-017-9583-3
Estado	Publicada - 1 ago. 2018

Acceder al documento

10.1007/s10444-017-9583-3

Otros archivos y enlaces

Enlace a la publicación en Scopus

Citar esto

@article{d89ae6978ac949abb7ba6885b6f72f74,

title = "A note on “Reguralizers for structured sparsity”",

abstract = "In this note, the notion of admissible sets contained in the strictly positive orthant introduced in Micchelli et al. (Adv. Comp. Math. 38(3), 455–489 2013) is analyzed. This notion was used to generalize theoretical results and optimization methods for structured sparsity. Unfortunately, we will prove that there is no generalization using admissible sets.",

keywords = "Convex optimization, Feature selection, LASSO, Regularization, Sparse estimation",

author = "F. Lara",

note = "Publisher Copyright: {\textcopyright} 2017, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2018",

month = aug,

day = "1",

doi = "10.1007/s10444-017-9583-3",

language = "English",

volume = "44",

pages = "1321--1323",

journal = "Advances in Computational Mathematics",

issn = "1019-7168",

publisher = "Springer Nature",

number = "4",

}

TY - JOUR

T1 - A note on “Reguralizers for structured sparsity”

AU - Lara, F.

PY - 2018/8/1

Y1 - 2018/8/1

N2 - In this note, the notion of admissible sets contained in the strictly positive orthant introduced in Micchelli et al. (Adv. Comp. Math. 38(3), 455–489 2013) is analyzed. This notion was used to generalize theoretical results and optimization methods for structured sparsity. Unfortunately, we will prove that there is no generalization using admissible sets.

AB - In this note, the notion of admissible sets contained in the strictly positive orthant introduced in Micchelli et al. (Adv. Comp. Math. 38(3), 455–489 2013) is analyzed. This notion was used to generalize theoretical results and optimization methods for structured sparsity. Unfortunately, we will prove that there is no generalization using admissible sets.

KW - Convex optimization

KW - Feature selection

KW - LASSO

KW - Regularization

KW - Sparse estimation

UR - https://www.scopus.com/pages/publications/85038359895

U2 - 10.1007/s10444-017-9583-3

DO - 10.1007/s10444-017-9583-3

M3 - Article

AN - SCOPUS:85038359895

SN - 1019-7168

VL - 44

SP - 1321

EP - 1323

JO - Advances in Computational Mathematics

JF - Advances in Computational Mathematics

IS - 4

ER -

A note on “Reguralizers for structured sparsity”

Resumen

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto