SDP relaxation algorithms for P(P₀)-tensor detection
From MaRDI portal
Publication:2307706
DOI10.1007/S10589-019-00145-2OpenAlexW2981324114MaRDI QIDQ2307706FDOQ2307706
Publication date: 25 March 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-019-00145-2
Multilinear algebra, tensor calculus (15A69) Semidefinite programming (90C22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Eigenvalues of a real supersymmetric tensor
- Global optimization with polynomials and the problem of moments
- Most Tensor Problems Are NP-Hard
- Eigenvalues and invariants of tensors
- Z-eigenvalue methods for a global polynomial optimization problem
- Shifted Power Method for Computing Tensor Eigenpairs
- GloptiPoly 3: moments, optimization and semidefinite programming
- Optimization of Polynomials on Compact Semialgebraic Sets
- Properties of some classes of structured tensors
- The cubic spherical optimization problems
- The Best Rank-One Approximation Ratio of a Tensor Space
- Some remarks on \(P\), \(P_0\), \(B\) and \(B_0\) tensors
- A penalized Fischer-Burmeister NCP-function
- SOS tensor decomposition: theory and applications
- Certifying convergence of Lasserre's hierarchy via flat truncation
- An Asymptotic Approach for Testing P0-Matrices
- All Real Eigenvalues of Symmetric Tensors
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- The P-matrix problem is co-NP-complete
- A recursive test for P-matrices
- Tensor complementarity problems. I: Basic theory
- Tensor complementarity problems. II: Solution methods
- Tensor complementarity problems. III: Applications
- An algorithmic characterization of \(\mathbf P\)-matricity
- \(\mathrm{P}\)-tensors, \(\mathrm{P}_0\)-tensors, and their applications
- Real eigenvalues of nonsymmetric tensors
- A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
Cited In (2)
Uses Software
This page was built for publication: SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307706)
