Sharp, strong, and unique minimizers for low complexity robust recovery - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information and Inference Année : 2023

Sharp, strong, and unique minimizers for low complexity robust recovery

Résumé

In this paper, we show the important roles of sharp minima and strong minima for robust recovery. We also obtain several characterizations of sharp minima for convex regularized optimization problems. Our characterizations are quantitative and verifiable especially for the case of decomposable norm regularized problems including sparsity, group-sparsity, and low-rank convex problems. For group-sparsity optimization problems, we show that a unique solution is a strong solution and obtain quantitative characterizations for solution uniqueness.
Fichier principal
Vignette du fichier
Robust.pdf (447.36 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03989390 , version 1 (14-02-2023)

Identifiants

Citer

Jalal M. Fadili, Nghia Tran T. A., Tran Trinh T. T.. Sharp, strong, and unique minimizers for low complexity robust recovery. Information and Inference, In press, 12 (3), ⟨10.1093/imaiai/iaad005⟩. ⟨hal-03989390⟩
31 Consultations
21 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More