Relationship between the optimal solutions of least squares regularized with L0-norm and constrained by k-sparsity - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2014

Relationship between the optimal solutions of least squares regularized with L0-norm and constrained by k-sparsity

Résumé

Given an M × N real-valued matrix A with M < N and a data-vector d, consider that d must be expressed as a linear combination of a small number of basis vectors taken from A. Two popular options to find the sought-after sparse solution are (1) to minimize the least-squares regularized with the counting function ∥ * ∥0 (called usually the ℓ0-norm) via a trade-off parameter β > 0, and (2) to solve the least-squares constrained by k-sparsity, i.e. ∥ * ∥0 6 k. This work provides an exhaustive description of the relationship between the optimal solutions of these two nonconvex (combinatorial) optimization problems. Small-size exact numerical tests give a flavor of the meaning of the obtained theoretical results.
Fichier principal
Vignette du fichier
KsparsLo.pdf (176.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00944006 , version 1 (10-02-2014)
hal-00944006 , version 2 (02-11-2014)
hal-00944006 , version 3 (06-11-2015)
hal-00944006 , version 4 (10-11-2015)
hal-00944006 , version 5 (27-08-2017)

Identifiants

  • HAL Id : hal-00944006 , version 1

Citer

Mila Nikolova. Relationship between the optimal solutions of least squares regularized with L0-norm and constrained by k-sparsity. 2014. ⟨hal-00944006v1⟩
375 Consultations
476 Téléchargements

Partager

Gmail Facebook X LinkedIn More