Isolated Calmness in Regularized Convex Optimization
Tran T. A. Nghia, Huy N. Pham
TL;DR
This work addresses the stability of the optimal solution map in regularized convex composite optimization by introducing a geometric characterization of isolated calmness in terms of kernels and tangent cones tied to the second-order subgradient structure. It develops a zero-product property for the subgradient graphical derivative and leverages quadratic growth conditions to connect isolated calmness with strong second-order optimality. A central result provides necessary and sufficient conditions for isolated calmness in the general composite problem min f(x,p)+g(Kx), with RCQ- and SRCQ-based implications, including concrete corollaries for least-squares with regularizers such as the nuclear norm and group Lasso. The findings yield verifiable criteria for stability of KKT/Lagrange systems and establish equivalences to strong local minimality and, in key cases, to solution uniqueness, with potential applications in inference and inverse problems.
Abstract
This paper studies the isolated calmness of the optimal solution mapping and the associated Lagrange system for regularized convex composite optimization problems. Several necessary and sufficient conditions for this property are established. These conditions are geometric in nature and relatively simple to verify. To support the analysis, we also develop a so-called zero-product property for second-order structures, namely the graphical derivative of the subgradient mapping of convex functions.
