Pith. sign in

REVIEW

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.11168 v2 pith:NSTRLZNB submitted 2023-12-18 math.OC

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View

classification math.OC
keywords solutiongaugeregularizationsparseuniquenessoptimizationrecoveryrobust
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this paper, we focus on the exploration of solution uniqueness, sharpness, and robust recovery in sparse regularization with a gauge $J$. Based on the criteria for the uniqueness of Lagrange multipliers in the dual problem, we give a characterization of the unique solution via the so-called radial cone. We establish characterizations of the isolated calmness (i.e., uniqueness of solutions combined with the calmness properties) of two types of the solution mappings and prove that they are equivalent under the assumption of metric subregularity of the subdifferentials for regularizers. Furthermore, we present sufficient and necessary conditions for a sharp solution, and show that these conditions guarantee robust recovery with a linear rate and imply local upper Lipschitzian properties of the solution mapping. Some applications of the polyhedral regularizer case such as sparse analysis regularization, weighted sorted $\ell_1$-norm sparse regularization, and non-polyhedral regularizer cases such as nuclear norm optimization, conic gauge optimization, and semidefinite conic gauge optimization are given.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.