IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v275y2016icp50-62.html
   My bibliography  Save this article

Further results on Cauchy tensors and Hankel tensors

Author

Listed:
  • Chen, Haibin
  • Li, Guoyin
  • Qi, Liqun

Abstract

In this article, we present various new results on Cauchy tensors and Hankel tensors. We first introduce the concept of generalized Cauchy tensors which extends Cauchy tensors in the current literature, and provide several conditions characterizing positive semi-definiteness of generalized Cauchy tensors with nonzero entries. Furthermore, we prove that all even order generalized Cauchy tensors with positive entries are completely positive tensors, which means every such that generalized Cauchy tensor can be decomposed as the sum of nonnegative rank-1 tensors. We also establish that all the H-eigenvalues of nonnegative Cauchy tensors are nonnegative. Secondly, we present new mathematical properties of Hankel tensors. We prove that an even order Hankel tensor is Vandermonde positive semi-definite if and only if its associated plane tensor is positive semi-definite. We also show that, if the Vandermonde rank of a Hankel tensor A is less than the dimension of the underlying space, then positive semi-definiteness of A is equivalent to the fact that A is a complete Hankel tensor, and so, is further equivalent to the SOS property of A. Thirdly, we introduce a new class of structured tensors called Cauchy–Hankel tensors, which is a special case of Cauchy tensors and Hankel tensors simultaneously. Sufficient and necessary conditions are established for an even order Cauchy-Hankel tensor to be positive definite.

Suggested Citation

  • Chen, Haibin & Li, Guoyin & Qi, Liqun, 2016. "Further results on Cauchy tensors and Hankel tensors," Applied Mathematics and Computation, Elsevier, vol. 275(C), pages 50-62.
  • Handle: RePEc:eee:apmaco:v:275:y:2016:i:c:p:50-62
    DOI: 10.1016/j.amc.2015.11.051
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315015532
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2015.11.051?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Shenglong Hu & Guoyin Li & Liqun Qi & Yisheng Song, 2013. "Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 717-738, September.
    2. Yisheng Song & Liqun Qi, 2015. "Properties of Some Classes of Structured Tensors," Journal of Optimization Theory and Applications, Springer, vol. 165(3), pages 854-873, June.
    3. Laurent, M., 2009. "Sums of squares, moment matrices and optimization over polynomials," Other publications TiSEM 9fef820b-69d2-43f2-a501-e, Tilburg University, School of Economics and Management.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jinyan Fan & Jiawang Nie & Anwa Zhou, 2019. "Completely Positive Binary Tensors," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 1087-1100, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiao Wang & Xinzhen Zhang & Guangming Zhou, 2020. "SDP relaxation algorithms for $$\mathbf {P}(\mathbf {P}_0)$$P(P0)-tensor detection," Computational Optimization and Applications, Springer, vol. 75(3), pages 739-752, April.
    2. Shenglong Hu & Guoyin Li & Liqun Qi, 2016. "A Tensor Analogy of Yuan’s Theorem of the Alternative and Polynomial Optimization with Sign structure," Journal of Optimization Theory and Applications, Springer, vol. 168(2), pages 446-474, February.
    3. Laurent, Monique & Vargas, Luis Felipe, 2022. "Finite convergence of sum-of-squares hierarchies for the stability number of a graph," Other publications TiSEM 3998b864-7504-4cf4-bc1d-f, Tilburg University, School of Economics and Management.
    4. Laurent, M. & Rostalski, P., 2012. "The approach of moments for polynomial equations," Other publications TiSEM f08f3cd2-b83e-4bf1-9322-a, Tilburg University, School of Economics and Management.
    5. Tomohiko Mizutani & Makoto Yamashita, 2013. "Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables," Journal of Global Optimization, Springer, vol. 56(3), pages 1073-1100, July.
    6. Zheng-Hai Huang & Yu-Fan Li & Yong Wang, 2023. "A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors," Journal of Global Optimization, Springer, vol. 86(2), pages 495-520, June.
    7. Fook Wai Kong & Polyxeni-Margarita Kleniati & Berç Rustem, 2012. "Computation of Correlated Equilibrium with Global-Optimal Expected Social Welfare," Journal of Optimization Theory and Applications, Springer, vol. 153(1), pages 237-261, April.
    8. Sandra S. Y. Tan & Antonios Varvitsiotis & Vincent Y. F. Tan, 2021. "Analysis of Optimization Algorithms via Sum-of-Squares," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 56-81, July.
    9. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.
    10. Xue-Li Bai & Zheng-Hai Huang & Yong Wang, 2016. "Global Uniqueness and Solvability for Tensor Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 170(1), pages 72-84, July.
    11. Yan, Weijie & Ling, Chen & Ling, Liyun & He, Hongjin, 2019. "Generalized tensor equations with leading structured tensors," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 311-324.
    12. P. M. Kleniati & P. Parpas & B. Rustem, 2010. "Decomposition-based Method for Sparse Semidefinite Relaxations of Polynomial Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 145(2), pages 289-310, May.
    13. Na Zhao & Qingzhi Yang & Yajun Liu, 2017. "Computing the generalized eigenvalues of weakly symmetric tensors," Computational Optimization and Applications, Springer, vol. 66(2), pages 285-307, March.
    14. Yisheng Song & Liqun Qi, 2016. "Eigenvalue analysis of constrained minimization problem for homogeneous polynomial," Journal of Global Optimization, Springer, vol. 64(3), pages 563-575, March.
    15. T. D. Chuong & V. Jeyakumar & G. Li, 2019. "A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs," Journal of Global Optimization, Springer, vol. 75(4), pages 885-919, December.
    16. O. P. Ferreira & S. Z. Németh, 2019. "On the spherical convexity of quadratic functions," Journal of Global Optimization, Springer, vol. 73(3), pages 537-545, March.
    17. Ya-nan Zheng & Wei Wu, 2018. "On a Class of Semi-Positive Tensors in Tensor Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 177(1), pages 127-136, April.
    18. Papp, Dávid & Regős, Krisztina & Domokos, Gábor & Bozóki, Sándor, 2023. "The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices," European Journal of Operational Research, Elsevier, vol. 310(2), pages 511-517.
    19. Tong-tong Shang & Guo-ji Tang, 2023. "Structured tensor tuples to polynomial complementarity problems," Journal of Global Optimization, Springer, vol. 86(4), pages 867-883, August.
    20. Jiawang Nie & Suhan Zhong, 2023. "Loss functions for finite sets," Computational Optimization and Applications, Springer, vol. 84(2), pages 421-447, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:275:y:2016:i:c:p:50-62. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.