Geometry of the Copositive Tensor Cone and its Dual
From MaRDI portal
Publication:5149522
DOI10.1142/S0217595920400084zbMath1457.15025OpenAlexW3028485375MaRDI QIDQ5149522
Publication date: 11 February 2021
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595920400084
Positive matrices and their generalizations; cones of matrices (15B48) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Multilinear algebra, tensor calculus (15A69) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (4)
Optimal ordering policy for supply option contract with spot market ⋮ New M-eigenvalue intervals and application to the strong ellipticity of fourth-order partially symmetric tensors ⋮ Approximation hierarchies for copositive cone over symmetric cone and their comparison ⋮ An SDP method for copositivity of partially symmetric tensors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Positive-definite tensors to nonlinear complementarity problems
- Eigenvalue analysis of constrained minimization problem for homogeneous polynomial
- Tensor complementarity problem and semi-positive tensors
- Global uniqueness and solvability for tensor complementarity problems
- Symmetric nonnegative tensors and copositive tensors
- Spectra of uniform hypergraphs
- Geometry of the copositive and completely positive cones
- Copositive tensor detection and its applications in physics and hypergraphs
- Copositivity detection of tensors: theory and algorithm
- Strictly semi-positive tensors and the boundedness of tensor complementarity problems
- On copositiveness identification of partially symmetric rectangular tensors
- A new C-eigenvalue interval for piezoelectric-type tensors
- Completely positive reformulations for polynomial optimization
- Exceptionally regular tensors and tensor complementarity problems
- Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
- HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS
- Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm
- On the cone eigenvalue complementarity problem for higher-order tensors
This page was built for publication: Geometry of the Copositive Tensor Cone and its Dual