Geometric characterizations of Lipschitz stability for convex optimization problems

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Nghia, Tran T. A.
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866909494822305792
author Nghia, Tran T. A.
author_facet Nghia, Tran T. A.
contents In this paper, we mainly study tilt stability and Lipschitz stability of convex optimization problems. Our characterizations are geometric and fully computable in many important cases. As a result, we apply our theory to the group Lasso problem and the nuclear norm minimization problem and reveal that the Lipschitz stability of the solution mapping in these problems is automatic whenever the solution mapping is single-valued.
format Preprint
id arxiv_https___arxiv_org_abs_2402_05215
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Geometric characterizations of Lipschitz stability for convex optimization problems
Nghia, Tran T. A.
Optimization and Control
49J52, 49J53, 49K40, 90C25, 90C31
In this paper, we mainly study tilt stability and Lipschitz stability of convex optimization problems. Our characterizations are geometric and fully computable in many important cases. As a result, we apply our theory to the group Lasso problem and the nuclear norm minimization problem and reveal that the Lipschitz stability of the solution mapping in these problems is automatic whenever the solution mapping is single-valued.
title Geometric characterizations of Lipschitz stability for convex optimization problems
topic Optimization and Control
49J52, 49J53, 49K40, 90C25, 90C31
url https://arxiv.org/abs/2402.05215