Advertisement

Metric subregularity and/or calmness of the normal cone mapping to the p-order conic constraint system

  • Ying Sun
  • Shaohua Pan
  • Shujun BiEmail author
Original Paper
  • 33 Downloads

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\}\).

Keywords

Normal cone mapping p-Order cone constraint systems Metric subregularity Calmness 

Notes

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.

References

  1. 1.
    Aragón Artacho, F.J., Geoffroy, M.H.: Characterization of metric regularity of subdifferentials. J. Convex Anal. 15, 365–380 (2008)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2000)CrossRefGoogle Scholar
  3. 3.
    Chan, Z.X., Sun, D.F.: Constraint nondegeneracy, strong regularity, and nonsingularity in semidefinite programming. SIAM J. Optim. 19, 370–396 (2008)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, Philadelphia (1990)CrossRefGoogle Scholar
  5. 5.
    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)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Da Costa, A.P., Seeger, A.: Numerical resolution of cone-constrained eigenvalue problems. Comput. Appl. Math. 28, 37–61 (2009)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Dontchev, A.L., Rockafellar, R.T.: Implicit Functions and Solution Mappings—A View from Variational Analysis. Springer, Berlin (2009)CrossRefGoogle Scholar
  8. 8.
    Eldar, Y.C., Kuppinger, P., Bolcskei, H.: Block-sparse signals: uncertainty relations and efficient recovery. IEEE T. Signal Process. 58, 3042–3054 (2010)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Fornasier, M., Rauhut, H.: Recovery algorithms for vector-valued data with joint sparsity constraints. SIAM J. Numer. Anal. 46, 577–613 (2008)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Gfrerer, H.: First order and second order characterizations of metric subregularity and calmness of constraint set mappings. SIAM J. Optim. 21, 1439–1474 (2011)MathSciNetCrossRefGoogle Scholar
  11. 11.
    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)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Gfrerer, H., Outrata, J.V.: On Lipschitzian properties of implicit multifunctions. SIAM J. Optim. 26, 2160–2189 (2016)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Henrion, R., Jourani, R., Outrata, J.: On the calmness of a class of multifunctions. SIAM J. Optim. 13, 603–618 (2002)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Henrion, R., Outrata, J.: A subdifferential condition for calmness of multifunctions. J. Math. Anal. Appl. 258, 110–130 (2001)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Henrion, R., Outrata, J.: Calmness of constraint systems with applications. Math. Program. 104, 437–464 (2005)MathSciNetCrossRefGoogle Scholar
  16. 16.
    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)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Ioffe, A.D., Outrata, J.V.: On metric and calmness qualification conditions in subdifferential calculus. Set-Valued Anal. 16, 199–227 (2008)MathSciNetCrossRefGoogle Scholar
  18. 18.
    King, A.J., Rockafellar, R.T.: Sensitivity analysis for nonsmooth generalized equations. Math. Program. 55, 193–212 (1992)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Klatte, D., Kummer, B.: Constrained minima and Lipschitizan penalties in metric spaces. SIAM J. Optim. 13, 619–633 (2002)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Kloft, M., Brefeld, U., Sonnenburg, S., Zien, A.: \(\ell _p\)-norm multiple kernel learning. J. Mach. Learn. Res. 12, 953–997 (2011)MathSciNetzbMATHGoogle Scholar
  21. 21.
    Levy, A.B.: Solution sensitivity from general principles. SIAM J. Control Optim. 40, 1–38 (2001)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Lewis, A.S.: The convex analysis of unitarily invariant matrix functions. J. Convex Anal. 2, 173–183 (1995)MathSciNetzbMATHGoogle Scholar
  23. 23.
    Li, W., Singer, I.: Global error bounds for convex multifunctions and applications. Math. Oper. Res. 23, 443–462 (1998)MathSciNetCrossRefGoogle Scholar
  24. 24.
    Pang, J.S.: Error bounds in mathematical programming. Math. Program. 79, 299–332 (1997)MathSciNetzbMATHGoogle Scholar
  25. 25.
    Robinson, S.M.: Some continuity properties of polyhedral multifunctions. Math. Program. 14, 206–214 (1981)MathSciNetCrossRefGoogle Scholar
  26. 26.
    Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)CrossRefGoogle Scholar
  27. 27.
    Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)CrossRefGoogle Scholar
  28. 28.
    Song, W.: Calmness and error bounds for convex constraint systems. SIAM J. Optim. 17, 353–371 (2006)MathSciNetCrossRefGoogle Scholar
  29. 29.
    Tseng, P., Yun, S.W.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117, 387–423 (2009)MathSciNetCrossRefGoogle Scholar
  30. 30.
    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)MathSciNetCrossRefGoogle Scholar
  31. 31.
    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)MathSciNetzbMATHGoogle Scholar
  32. 32.
    Zhou, Z.R.: Error bounds for structured convex programming: theory and applications. Ph.D. thesis, The Chinese University of Hong Kong (2015)Google Scholar
  33. 33.
    Zhou, Z.R., So, A.M.C.: A unified approach to error bounds for structured convex optimization problems. Math. Program. 165, 689–728 (2017)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.South China University of TechnologyGuangzhouChina

Personalised recommendations