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

branch and bound algorithmcopositive programminglinear programmingmatrix decompositionmaximum clique problem

Mathematics Subject Classification ID

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

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)

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

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)