A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (Q4687245)

scientific article; zbMATH DE number 6951771

Language	Label	Description	Also known as
English	A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors	scientific article; zbMATH DE number 6951771

Statements

instance of

scholarly article

0 references

title

A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (English)

0 references

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

11 October 2018

0 references

full work available at URL

https://arxiv.org/abs/1711.03704

0 references

zbMATH Keywords

symmetric matrix

0 references

copositive matrix

0 references

tensor

0 references

semidefinite relaxation

0 references

describes a project that uses

GloptiPoly

0 references

SeDuMi

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Criteria for copositive matrices using simplices and barycentric coordinates

0 references

Open problems in the theory of completely positive and copositive matrices

0 references

Linear-Time Copositivity Detection for Tridiagonal Matrices and Extension to Block-Tridiagonality

0 references

Copositive optimization -- recent developments and applications

0 references

Copositivity detection by difference-of-convex decomposition and $\omega $-subdivision

0 references

Algorithmic copositivity detection by simplicial partition

0 references

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

0 references

On the copositive representation of binary and continuous nonconvex quadratic programs

0 references

Positive-definite tensors to nonlinear complementarity problems

0 references

Copositive tensor detection and its applications in physics and hypergraphs

0 references

Copositivity detection of tensors: theory and algorithm

0 references

All Real Eigenvalues of Symmetric Tensors

0 references

Approximation of the Stability Number of a Graph via Copositive Programming

0 references

Aspects of semidefinite programming. Interior point algorithms and selected applications

0 references

A linear programming reformulation of the standard quadratic optimization problem

0 references

Q3843714

0 references

Scaling relationship between the copositive cone and Parrilo's first level approximation

0 references

On the computational complexity of membership problems for the completely positive cone and its dual

0 references

Exploiting symmetry in copositive programs via semidefinite hierarchies

0 references

Copositive programming motivated bounds on the stability and the chromatic numbers

0 references

Testing copositivity with the help of difference-of-convex optimization

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

Linear inequalities and quadratic forms

0 references

Geometric algorithms and combinatorial optimization

0 references

Q5328177

0 references

GloptiPoly 3: moments, optimization and semidefinite programming

0 references

Exact Algorithms for Linear Matrix Inequalities

0 references

The extreme rays of the $5 \times 5$ copositive cone

0 references

A Variational Approach to Copositive Matrices

0 references

On copositive matrices with -1, 9, 1 entries

0 references

Q5316981

0 references

A test for copositive matrices

0 references

Global Optimization with Polynomials and the Problem of Moments

0 references

On Linear Copositive Lyapunov Functions and the Stability of Switched Positive Linear Systems

0 references

Maxima for Graphs and a New Proof of a Theorem of Turán

0 references

Some NP-complete problems in quadratic and nonlinear programming

0 references

Certifying convergence of Lasserre's hierarchy via flat truncation

0 references

The $\mathcal A$-truncated $K$-moment problem

0 references

Completely positive reformulations for polynomial optimization

0 references

On the complexity of semidefinite programs

0 references

Symmetric nonnegative tensors and copositive tensors

0 references

On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

0 references

On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination

0 references

On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination

0 references

Q4496287

0 references

Q5287551

0 references

Optimization of Polynomials on Compact Semialgebraic Sets

0 references

Necessary and sufficient conditions for copositive tensors

0 references

Properties of Tensor Complementarity Problem and Some Classes of Structured Tensors

0 references

Tensor complementarity problem and semi-positive tensors

0 references

An improved algorithm to test copositivity

0 references

Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

0 references

Semidefinite optimization

0 references

$M$-Tensors and Some Applications

0 references

Identifiers

zbMATH Open document ID

1406.15026

0 references

DOI

10.1137/17M115308X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4687245