A modified simplex partition algorithm to test copositivity

DOI10.1007/S10898-021-01092-1zbMATH Open1484.65128OpenAlexW3204625658MaRDI QIDQ2052385FDOQ2052385

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

Recommendations

• Algorithmic copositivity detection by simplicial partition
• Criteria for copositive matrices
• An algorithm for determining copositive matrices
• An improved algorithm to test copositivity
• An LP-based algorithm to test copositivity

zbMATH Keywords

semidefinite programmingsimplexcopositive programmingmaximum clique problemcopositive matrix

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Algorithmic copositivity detection by simplicial partition

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052385)