Eigenvalue analysis of constrained minimization problem for homogeneous polynomial
arXiv:1302.6085 · doi:10.1007/s10898-015-0343-y
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.
14 pages. arXiv admin note: text overlap with arXiv:1302.6084
References in corpus (2)
Cited by in corpus (14)
- Properties of Solution set of Tensor Complementarity Problem
- Strictly semi-positive tensors and the boundedness of tensor complementarity problems
- B tensors and tensor complementarity problems
- Analytical expressions of copositivity for 4th order symmetric tensors and applications
- Copositivity for 3rd order symmetric tensors and applications
- Copositivity for a class of fourth order symmetric tensors given by scalar dark matter
- Infinite dimensional Hilbert tensors on spaces of analytic functions
- Eigenvalues and structured properties of P-tensors
- Copositivity Detection of Tensors: Theory and Algorithm
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problem
- A Semismooth Newton Method for Tensor Eigenvalue Complementarity Problem
- Higher-degree eigenvalue complementarity problems for tensors
- Copositive Tensor Detection and Its Applications in Physics and Hypergraphs
- On the cone eigenvalue complementarity problem for higher-order tensors