An LP-based algorithm to test copositivity

MaRDI QIDQ5501735zbMATH OpenFDO

Authors Akihiro Tanaka, Akiko Yoshise

Publication date 14 August 2015

Full work available at URL http://www.yokohamapublishers.jp/online2/oppjo/vol11/p101.html

zbMATH Keywords

linear programmingmatrix decompositioncopositive programmingmaximum clique problembranch and bound algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Combinatorial optimization (90C27) Semidefinite programming (90C22) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Recommendations

• An improved algorithm to test copositivity
• A copositivity probe
• A modified simplex partition algorithm to test copositivity
• Copositivity tests based on the linear complementarity problem
• Algorithmic copositivity detection by simplicial partition

Cited in

(12)

• Testing copositivity via mixed-integer linear programming
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
• Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
• An improved algorithm to test copositivity
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
• A note on algorithms for determining the copositivity of a given symmetric matrix
• The positive edge criterion within COIN-OR's CLP
• LP-based tractable subcones of the semidefinite plus nonnegative cone
• A modified simplex partition algorithm to test copositivity
• Performance comparison of two recently proposed copositivity tests
• Copositivity tests based on the linear complementarity problem
• Algorithmic copositivity detection by simplicial partition

This page was built for publication: An LP-based algorithm to test copositivity

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