Eigenvalue analysis of constrained minimization problem for homogeneous polynomial (Q280985): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1302.6085 / rank | |||
Normal rank |
Revision as of 12:16, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Eigenvalue analysis of constrained minimization problem for homogeneous polynomial |
scientific article |
Statements
Eigenvalue analysis of constrained minimization problem for homogeneous polynomial (English)
0 references
10 May 2016
0 references
The paper is dedicated to the study of constrained minimization problems and, using the concepts of the Pareto \(H\)-eigenvalue and the Pareto \(Z\)-eigenvalue, to the derivation of the necessary and sufficient conditions of such eigenvalues. It is shown that ``a symmetric tensor has at least one Pareto \(H\)-eigenvalue (Pareto \(Z\)-eigenvalue)'' and that ``the minimum Pareto \(H\)-eigenvalue (or Pareto \(Z\)-eigenvalue) of a symmetric tensor is exactly equal to the minimum value of the constrained minimization problem of the homogeneous polynomial deduced by such a tensor''. This result may be used as ``an alternative method for solving the minimum value of the constrained minimization problem''. ``As a corollary, a symmetric tensor \(\mathcal A\) is copositive if and only if every Pareto \(H\)-eigenvalue (\(Z\)-eigenvalue) of \(\mathcal A\) is nonnegative and \(\mathcal A\) is strictly copositive if and only if every Pareto \(H\)-eigenvalue (\(Z\)-eigenvalue) of \(\mathcal A\) is positive.''
0 references
constrained minimization
0 references
principal sub-tensor
0 references
Pareto \(H\)-eigenvalue
0 references
Pareto \(Z\)-eigenvalue
0 references