A modified simplex partition algorithm to test copositivity

DOI10.1007/s10898-021-01092-1zbMath1484.65128OpenAlexW3204625658MaRDI QIDQ2052385

Richard J. Caron, Mohammad Reza Safi, Seyed Saeed Nabavi

Publication date: 26 November 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-021-01092-1

zbMATH Keywords

semidefinite programmingcopositive programmingcopositive matrixsimplexmaximum clique problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Numerical linear algebra (65F99) Mathematical programming (90C99)

Cites Work

• Unnamed Item
• An improved algorithm to test copositivity
• Evolution towards the maximum clique
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
• On the copositive representation of binary and continuous nonconvex quadratic programs
• On the exhaustivity of simplicial partitioning
• Algorithmic copositivity detection by simplicial partition
• Depth-first simplicial partition for copositivity detection, with an application to MaxClique
• Some NP-complete problems in quadratic and nonlinear programming
• On copositive programming and standard quadratic optimization problems

This page was built for publication: A modified simplex partition algorithm to test copositivity