Abstract

This paper is devoted to the study of variational analysis of the orthogonally invariant norm cone of symmetric matrices. For a general orthogonally invariant norm cone of symmetric matrices, formulas for the tangent cone, normal cone and second-order tangent set are established. The differentiability properties of the projection operator onto the orthogonally invariant norm cone are developed, including formulas for the directional derivative and the B-subdifferential. In particular, the directional derivative is characterized by the second-order derivative of the corresponding symmetric norm, which is convenient for computation.

Author information

Contact details are reproduced from the original publication and may be historical.

Liwei Zhang

(1) National Frontiers Science Center, Industrial Intelligence & Systems Optimization, Northeastern University, Shenyang, China
(2) Key Laboratory of Data Analytics, Northeastern University, Ministry of Education, Shenyang, China

zhanglw@mail.neu.edu.cn

Keywords

  • Orthogonally invariant norm cone
  • variational analysis
  • tangent cone
  • normal cone
  • outer second-order tangent set
  • projection
  • directional derivative
  • B-subdifferential

Mathematics Subject Classification

90C30

References

  1. A. Beck: First-Order Methods in Optimization, Society for Industrial and Applied Mathematics, Philadelphia (2017).https://doi.org/10.1137/1.9781611974997Google Scholar
  2. J. F. Bonnans, A. Shapiro: Perturbation Analysis of Optimization Problems, Springer, New York (2000).https://doi.org/10.1007/978-1-4612-1394-9Google Scholar
  3. J. M. Borwein, A. S. Lewis: Convex Analysis and Nonlinear Optimization: Theory and Examples, Springer, New York (2006).https://doi.org/10.1007/978-0-387-31256-9Google Scholar
  4. S. Boyd, P. Diaconis, L. Xiao: Fastest mixing Markov chain on a graph, SIAM Review 46 (2004) 667–689.https://doi.org/10.1137/S0036144503423264Google Scholar
  5. E. J. Candes, B. Recht: Exact matrix completion via convex optimization, Found. Comput. Math. 9 (2009) 717–772.https://doi.org/10.1007/s10208-009-9045-5Google Scholar
  6. Y. Cui, C. Ding, X. Zhao: Quadratic growth conditions for convex matrix optimization problems associated with spectral functions, SIAM J. Optimization 27 (2017) 2332–2355.https://doi.org/10.1137/17M1116325Google Scholar
  7. C. Ding: Variational analysis of the Ky Fan k-norm, Set-Valued Var. Analysis 25 (2017) 265–296.https://doi.org/10.1007/s11228-016-0378-3Google Scholar
  8. C. Ding, D. F. Sun, J. Sun, K. C. Toh: Spectral operator of matrices, Math. Programming, Ser. B 168/1-2 (2018) 509–531.https://doi.org/10.1007/s10107-017-1162-3Google Scholar
  9. C. Ding, D. F. Sun, J. Sun, K. C. Toh: Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian, SIAM J. Optimization 30 (2020) 630–659.https://doi.org/10.1137/18M1222235Google Scholar
  10. C. Ding, D. F. Sun, K. C. Toh: An introduction to a class of matrix cone programming, Math. Programming, Ser. A 144/1-2 (2014) 141–179.https://doi.org/10.1007/s10107-012-0619-7Google Scholar
  11. C. Ding, D. F. Sun, L. W. Zhang: Characterization of the robust isolated calmness for a class of conic programming problems, SIAM J. Optimization 27 (2017) 67–90.https://doi.org/10.1137/16M1058753Google Scholar
  12. J. Ding, A. H. Zhou: A spectrum theorem for perturbed bounded linear operators, Appl. Math. Comput. 201/1 (2008) 723–728.https://doi.org/10.1016/j.amc.2008.01.008Google Scholar
  13. K. Fan: On a theorem of Weyl concerning eigenvalues of linear transformations, Proc. Nat. Acad. Sci. U.S.A. 35 (1949) 652–655.https://doi.org/10.1073/pnas.35.11.652Google Scholar
  14. G. H. Golub, C. F. Van Loan: Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore (1996).Google Scholar
  15. A. S. Lewis, H. S. Sendov: Twice differentiable spectral functions, SIAM J. Matrix Anal. Appl. 23/2 (2001) 368–386.https://doi.org/10.1137/S089547980036838XGoogle Scholar
  16. H. Y. Liu, J. Wu, L. W. Zhang: Variational analysis of norm cones in finite dimensional Euclidean spaces, Set-Valued Var. Analysis 31/3 (2023), art.no. 27, 28p.https://doi.org/10.1007/s11228-023-00691-2Google Scholar
  17. B. Recht, M. Fazel, P. A. Parrilo: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization, SIAM Review 52/3 (2010) 471–501.https://doi.org/10.1137/070697835Google Scholar
  18. D. F. Sun: The strong second order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications, Math. Oper. Res. 31 (2006) 761–776.https://doi.org/10.1287/moor.1060.0195Google Scholar
  19. G. A. Watson: Characterization of the subdifferential of some matrix norms, Linear Algebra Appl. 170 (1992) 33–45.https://doi.org/10.1016/0024-3795(92)90407-2Google Scholar

Suggested citation

Y. Zhang, J. Zhang, L. Zhang. “Variational Analysis of Orthogonally Invariant Norm Cones of Symmetric Matrices.” Journal of Convex Analysis 33 (2026), No. 1&2, 267–291. https://doi.org/10.68381/jca33017

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 2026. Rights now held by Banach Press.