optimization

Identifiability and Error Bounds: Metric and Geometric Perspectives

arXiv:2605.02754

summary

The paper studies how error‑bound properties for nonsmooth optimization problems are equivalent when considered in the whole space versus on an identifiable manifold, using geometric and slope‑based arguments.

Abstract

Identifiability and partial smoothness are important notions in optimization, linking differential geometry with variational analysis and providing a foundation for classical active-set methods, sensitivity analysis, and optimality conditions. These notions capture the local structure of nonsmooth optimization problems and often reduce their local analysis to that of a smooth restriction on an identifiable manifold. Motivated by this reduction, we study the error-bound property (EB) in the ambient space and on an identifiable manifold . Using a slope-based formulation, we prove that local EB on is equivalent to local EB on under identifiability. We further establish this equivalence under partial smoothness and the nondegeneracy condition. A key ingredient is a novel linear-growth result, which shows that regularity of is not required. In addition, we provide a complementary geometric analysis based on -theory. As an application, we recover the EB equivalence for -regularized optimization previously established in the literature.

Topics & keywords

#identifiability#error bounds#partial smoothness#variational analysis#geometric analysisidentifiable manifoldslope-based formulationVU-theoryℓ1-regularizationC1 partial smoothness