Abstract
For a finite convex function, we show that its subdifferential mapping is metrically subregular if and only if the normal cone mapping to its epigraph is metrically subregular. Then, for the nonconvex composition \(\psi =\theta \circ G\) where G is a continuously differentiable mapping and \(\theta \) is an extended real-valued function, we develop a criterion to identify the metric subregularity and calmness of the subdifferential mapping of \(\psi \) in terms of that of the subdifferential mapping of \(\theta \). Together with the existing results, we obtain the metric subregularity of the normal cone mapping to the vector and matrix p-order cone \(K_p\) and the conic constraint system \(g^{-1}(K_p)\) with \(p\in [1,2]\cup \{+\infty \}\), where g is a continuously differentiable mapping. We also establish the calmness of the normal cone mapping to \(K_p\) and \(g^{-1}(K_p)\) with \(p\in [2,+\infty ]\cup \{1\}\).
Similar content being viewed by others
References
Aragón Artacho, F.J., Geoffroy, M.H.: Characterization of metric regularity of subdifferentials. J. Convex Anal. 15, 365–380 (2008)
Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2000)
Chan, Z.X., Sun, D.F.: Constraint nondegeneracy, strong regularity, and nonsingularity in semidefinite programming. SIAM J. Optim. 19, 370–396 (2008)
Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, Philadelphia (1990)
Cui, Y., Ding, C., Zhao, X.Y.: Quadratic growth conditions for convex matrix optimization problems associated with spectral functions. SIAM J. Optim. 27, 2332–2355 (2017)
Da Costa, A.P., Seeger, A.: Numerical resolution of cone-constrained eigenvalue problems. Comput. Appl. Math. 28, 37–61 (2009)
Dontchev, A.L., Rockafellar, R.T.: Implicit Functions and Solution Mappings—A View from Variational Analysis. Springer, Berlin (2009)
Eldar, Y.C., Kuppinger, P., Bolcskei, H.: Block-sparse signals: uncertainty relations and efficient recovery. IEEE T. Signal Process. 58, 3042–3054 (2010)
Fornasier, M., Rauhut, H.: Recovery algorithms for vector-valued data with joint sparsity constraints. SIAM J. Numer. Anal. 46, 577–613 (2008)
Gfrerer, H.: First order and second order characterizations of metric subregularity and calmness of constraint set mappings. SIAM J. Optim. 21, 1439–1474 (2011)
Gfrerer, H., Outrata, J.V.: On computation of generalized derivatives of the normal-cone mapping and their applications. Math. Oper. Res. 41, 1535–1556 (2016)
Gfrerer, H., Outrata, J.V.: On Lipschitzian properties of implicit multifunctions. SIAM J. Optim. 26, 2160–2189 (2016)
Henrion, R., Jourani, R., Outrata, J.: On the calmness of a class of multifunctions. SIAM J. Optim. 13, 603–618 (2002)
Henrion, R., Outrata, J.: A subdifferential condition for calmness of multifunctions. J. Math. Anal. Appl. 258, 110–130 (2001)
Henrion, R., Outrata, J.: Calmness of constraint systems with applications. Math. Program. 104, 437–464 (2005)
Ioffe, A.D.: Necessary and sufficient conditions for a local minimum. 1: a reduction theorem and first order conditions. SIAM J. Control Optim. 17, 245–250 (1979)
Ioffe, A.D., Outrata, J.V.: On metric and calmness qualification conditions in subdifferential calculus. Set-Valued Anal. 16, 199–227 (2008)
King, A.J., Rockafellar, R.T.: Sensitivity analysis for nonsmooth generalized equations. Math. Program. 55, 193–212 (1992)
Klatte, D., Kummer, B.: Constrained minima and Lipschitizan penalties in metric spaces. SIAM J. Optim. 13, 619–633 (2002)
Kloft, M., Brefeld, U., Sonnenburg, S., Zien, A.: \(\ell _p\)-norm multiple kernel learning. J. Mach. Learn. Res. 12, 953–997 (2011)
Levy, A.B.: Solution sensitivity from general principles. SIAM J. Control Optim. 40, 1–38 (2001)
Lewis, A.S.: The convex analysis of unitarily invariant matrix functions. J. Convex Anal. 2, 173–183 (1995)
Li, W., Singer, I.: Global error bounds for convex multifunctions and applications. Math. Oper. Res. 23, 443–462 (1998)
Pang, J.S.: Error bounds in mathematical programming. Math. Program. 79, 299–332 (1997)
Robinson, S.M.: Some continuity properties of polyhedral multifunctions. Math. Program. 14, 206–214 (1981)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)
Song, W.: Calmness and error bounds for convex constraint systems. SIAM J. Optim. 17, 353–371 (2006)
Tseng, P., Yun, S.W.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117, 387–423 (2009)
Zheng, X.Y., Ng, K.F.: Metric subregularity and constraint qualifications for convex generalized equations in Banach spaces. SIAM J. Optim. 18, 437–460 (2007)
Zhou, J.C., Chen, J.S.: Properties of circular cone and spectral factorization associated with circular cone. J. Nonlinear Convex Anal. 14, 807–816 (2013)
Zhou, Z.R.: Error bounds for structured convex programming: theory and applications. Ph.D. thesis, The Chinese University of Hong Kong (2015)
Zhou, Z.R., So, A.M.C.: A unified approach to error bounds for structured convex optimization problems. Math. Program. 165, 689–728 (2017)
Acknowledgements
The authors would like to express their sincere thanks to anonymous referees for valuable suggestions and comments for the paper. The research of S. H. Pan was supported by the National Natural Science Foundation of China under Project No. 11571120 and the Natural Science Foundation of Guangdong Province under Project No. 2015A030313214, and S. J. Bi was supported by the National Natural Science Foundation of China under Project Nos. 11701186 and 11561015, and the Natural Science Foundation of Guangdong Province under Project No. 2017A030310418, and the Natural Science Foundation of Guangxi Province under Project No. 2016GXNSFFA380009.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
In this part, we shall establish the calmness of the subdifferential mappings of the vector and matrix \(\ell _p\) norms with \(p\in \{1\}\cup [2,+\infty ]\). The following lemma is required which follows directly by the convexity of \(\phi (t)=t^{\tau } (\tau \ge 1)\) for \(t\ge 0\).
Lemma 3
For any given \(a,b\in \mathbb {R}_{+}\) and \(\tau \ge 1\), the following inequality holds:
If in addition \(a,b\in [0,1]\), the inequality can be simplified as \(|a^\tau -b^\tau |\le \tau |a-b|\).
Proposition 1
Suppose that \(p\in \{1\}\cup [2,+\infty ]\). The following statements hold.
-
(i)
\(\partial f_p\) is calm at any \(\widehat{x}\in \mathbb {R}^n\) for any \(\widehat{y}\in \partial f_p(\widehat{x})\);
-
(ii)
\(\partial F_p\) is calm at any \(\widehat{X}\in \mathbb {R}^{n\times m}\) for any \(\widehat{W}\in \partial f_p(\widehat{X})\).
Proof
(i) By the remarks after Definition 2, it suffices to consider \(p\in [2,+\infty )\). Fix an arbitrary \(\widehat{x}\in \mathbb {R}^n\) and an arbitrary \(\widehat{y}\in \partial f_p(\widehat{x})\). The calmness of \(\partial f_p\) at \(\widehat{x}\) for \(\widehat{y}\) requires the existence of \(\kappa >0\) along with \(\varepsilon >0\) and \(\delta >0\) such that
Recall that the subdifferential mapping of \(f_p\) for \(p\in (1,+\infty )\) has the form of
For any given \(x\in \mathbb {R}^n\), write \(J(x):=\{i\in \{1,\ldots ,n\}: x_i\ne 0\}\) and define \(J_0(x):=\{i\in J(x): \widehat{y}_i=0\}\), \(J_{+}(x):=\{i\in J(x)\backslash J_0(x): \mathrm{sign}(x_i)=\mathrm{sign}(\widehat{y}_i)\}\) and \(J_{-}(x):=J(x)\backslash (J_0(x)\cup J_{+}(x))\). We proceed the arguments by two cases.
Case 1\(\widehat{x}=0\). Fix an arbitrary \(\varepsilon >0\) and an arbitrary \(\delta >0\). Let x be an arbitrary point from \(\mathbb {B}(\widehat{x},\varepsilon )\). By Eq. (26), it is immediate to check that
which implies the inclusion in (25) holds for any \(\kappa >0\). This means that any \(\kappa >0\) along with any \(\varepsilon >0\) and \(\delta >0\) satisfies the requirement of (25).
Case 2\(\widehat{x}\ne 0\). Since \(\lim _{z\rightarrow \widehat{x}}\Vert z\Vert _p=\Vert \widehat{x}\Vert _p>0\), there is \(\widehat{\varepsilon }\in (0,1)\) such that
Write \(\gamma :={\displaystyle \min \nolimits _{z\in \mathbb {B}(\widehat{x},\widehat{\varepsilon })}}\Vert z\Vert _p\). Clearly, \(\gamma >0\). Let \(\delta :={\displaystyle \max _{z\in \mathbb {B}(\widehat{x},\widehat{\varepsilon })}\max _{y\in \partial f_p(z)}}\Vert y-\widehat{y}\Vert +1\). Fix an arbitrary \(x\in \mathbb {B}(\widehat{x},\widehat{\varepsilon })\). Take an arbitrary \(y\in \partial f_p(x)\cap \mathbb {B}(\widehat{y},\delta )\). From (26),
For the second summand on the right hand side of (28), by Lemma 3 we have
For each \(i\in J_{+}(x)\), let \(h_i(z):=|z_i|/\Vert z\Vert _p\) for \(z\in \mathbb {B}(\widehat{x},\widehat{\varepsilon })\). Since \(\widehat{x}\ne 0\) and \(\widehat{y}\in \partial f_p(\widehat{x})\), clearly, \(\widehat{x}_i\ne 0\) for \(i\in J_{+}(x)\). This means that each \(h_i\) is continuously differentiable at \(\widehat{x}\), and hence is continuously differentiable over \(\mathbb {B}(\widehat{x},\widehat{\varepsilon })\) (making reduction on \(\widehat{\varepsilon }\) if necessary). From the mean-valued theorem, there exists \(\widetilde{x}\) in the segment between x and \(\widehat{x}\) such that
where the second inequality is by (27) and the expression of \(\varXi _p(\cdot )\). By (29),
For the rest three summands on the right hand side of (28), by virtue of (27),
By combining the last three equations with (28), it is not difficult to obtain
which implies that \(\mathrm{dist}(y,\partial f_p(\widehat{x}))\le \Vert y-\widehat{y}\Vert \le \frac{4\sqrt{2n}(p-1)}{\gamma }\Vert x-\widehat{x}\Vert \). By the arbitrariness of y in \(\partial f_p(x)\cap \mathbb {B}(\widehat{y},\delta )\), (25) holds for \(\kappa =\frac{4\sqrt{2n}(p-1)}{\gamma }\) and \(\widehat{\varepsilon }\).
(ii) From \((\widehat{X},\widehat{W})\in \mathrm{gph}\,\partial F_{p}\) and [22, Corollary 2.5], \(\sigma (\widehat{W})\in \partial f_p(\sigma (\widehat{X}))\). By [22, Lemma 2.3(b)], the conjugate \(f_p^*\) of \(f_p\) is absolutely symmetric, closed and convex. By the von Neumann’s trace inequality, it is easy to verify that \(F_p^*(X)=f_p^*(\sigma (X))\) for \(X\in \mathbb {R}^{n\times m}\), and hence \(F_p^*\) is closed and convex by [22, Corollary 2.5]. Recall that \(\partial f_p^*=(\partial f_p)^{-1}\). By the first part, \(\partial f_p^*\) is metrically subregular at \(\sigma (\widehat{W})\) for \(\sigma (\widehat{X})\). Using [5, Proposition 14] again, we conclude that \(\partial F_p^*=(\partial F_p)^{-1}\) is metrically subregular at \(\widehat{W}\) for \(\widehat{X}\). Consequently, the mapping \(\partial F_p\) is calm at \(\widehat{X}\) for \(\widehat{W}\) when \(p\in \{1\}\cup [2,+\infty ]\). \(\square \)
Rights and permissions
About this article
Cite this article
Sun, Y., Pan, S. & Bi, S. Metric subregularity and/or calmness of the normal cone mapping to the p-order conic constraint system. Optim Lett 13, 1095–1110 (2019). https://doi.org/10.1007/s11590-018-1373-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-018-1373-4