Eigenvalue analysis of constrained minimization problem for homogeneous polynomial
Abstract
In this paper, the concepts of Pareto -eigenvalue and Pareto -eigenvalue are introduced for studying constrained minimization problem and the necessary and sufficient conditions of such eigenvalues are given. It is proved that a symmetric tensor has at least one Pareto -eigenvalue (Pareto -eigenvalue). Furthermore, the minimum Pareto -eigenvalue (or Pareto -eigenvalue) of a symmetric tensor is exactly equal to the minimum value of constrained minimization problem of homogeneous polynomial deduced by such a tensor, which gives an alternative methods for solving the minimum value of constrained minimization problem. In particular, a symmetric tensor is copositive if and only if every Pareto -eigenvalue (eigenvalue) of is non-negative.
Cite
@article{arxiv.1302.6085,
title = {Eigenvalue analysis of constrained minimization problem for homogeneous polynomial},
author = {Yisheng Song and Liqun Qi},
journal= {arXiv preprint arXiv:1302.6085},
year = {2022}
}
Comments
14 pages. arXiv admin note: text overlap with arXiv:1302.6084