Abstract
A piezoelectric-type tensor is of order three that is symmetric with respect to the last two indices. Its largest C-eigenvalue determines the highest piezoelectric coupling constant. However, computing the largest C-eigenvalue is NP-hard. This paper addresses this problem using convex relaxation. To this end, we first establish an equivalence property that helps to rewrite the problem as a matrix optimization over rank-1 together with the partially symmetric tensor constraints. Then, via Lagrangian dual, convex relaxations are derived, yielding the problems of maximization of a linear function over one or two matrix nuclear norm constraint(s), together with a partially symmetric tensor constraint. Such relaxations define new norms, which are smaller than the spectral norms of the corresponding unfolding matrices. Several insights are provided for the tightness issues of the convex relaxations, including a certification, a sufficient criterion, and an equivalence condition. The spectral property of the dual variable, in particular, determines the tightness. When the convex relaxations are not tight, an approximation algorithm is proposed to extract a feasible approximation solution, with a theoretical lower bound provided. We provide several types of tensors to justify the tightness of the convex relaxations. In case that the relaxations are not tight, their optimal values, serving as upper bounds, are still tighter than those in the literature.
Similar content being viewed by others
References
Che, H., Chen, H., Wang, Y.: C-eigenvalue inclusion theorems for piezoelectric-type tensors. Appl. Math. Lett. 89, 41–49 (2019)
Chen, Y., Jákli, A., Qi, L.: Spectral analysis of piezoelectric tensors. arXiv:1703.07937 (2017)
He, S., Li, Z., Zhang, S.: Approximation algorithms for homogeneous polynomial optimization with quadratic constraints. Math. Program. 125, 353–383 (2010)
Hillar, C.J., Lim, L.H.: Most tensor problems are NP-hard. J. ACM 60(6), 45:1-45:39 (2013)
Horn, T., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1991)
Hu, S., Huang, Z.H., Qi, L.: Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method. Numer. Linear Algebra Appl. 20(6), 972–984 (2013)
Jiang, B., Ma, S., Zhang, S.: Tensor principal component analysis via convex optimization. Math. Program. Ser. A 150, 423–457 (2015)
Li, C., Liu, Y., Li, Y.: C-eigenvalues intervals for piezoelectric-type tensors. Appl. Math. Comput. 358, 244–250 (2019)
Li, S., Chen, Z., Li, C., Zhao, J.: Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices. Comput. Appl. Math. 39(3), 217 (2020)
Liang, C., Yang, Y.: Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor. Comput. Appl. Math. 40(7), 241 (2021)
Liu, X., Yin, S., Li, H.: C-eigenvalue intervals for piezoelectric-type tensors via symmetric matrices. J. Ind. Manag. Optim. 17(6), 3349–3356 (2021)
Meyer, C.D.: Matrix Analysis and Applied Linear Algebra, vol. 71. SIAM, Philadelphia (2000)
Nie, J., Wang, L.: Semidefinite relaxations for best rank-1 tensor approximations. SIAM J. Matrix Anal. Appl. 35(3), 1155–1179 (2014)
Song, Y., Qi, L.: Infinite and finite dimensional Hilbert tensors. Linear Algebra Appl. 451, 1–14 (2014)
Wang, W., Chen, H., Wang, Y.: A new C-eigenvalue interval for piezoelectric-type tensors. Appl. Math. Lett. 100, 106035 (2020)
Xiong, L., Liu, J.: A new C-eigenvalue localisation set for piezoelectric-type tensors. East Asian J. Appl. Math. 10(1), 123–134 (2020)
Yang, Y., Feng, Y., Huang, X., Suykens, J.A.K.: Rank-1 tensor properties with applications to a class of tensor optimization problems. SIAM J. Optim. 26(1), 171–196 (2016)
Acknowledgements
This work was supported by the National Natural Science Foundation of China Grants 11801100 and 12171105, the Fok Ying Tong Education Foundation Grant 171094, and the special foundation for Guangxi Ba Gui Scholars. All data generated or analyzed during this study are included in this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Liqun Qi.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Yang, Y., Liang, C. Computing the Largest C-Eigenvalue of a Tensor Using Convex Relaxation. J Optim Theory Appl 192, 648–677 (2022). https://doi.org/10.1007/s10957-021-01983-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-021-01983-z