- Copositivity detection by difference-of-convex decomposition and omega-subdivision Immanuel M. Bomze (immanuel.bomzeunivie.ac.at) Gabriele Eichfelder (Gabriele.Eichfeldertu-ilmenau.de) Abstract: We present three new copositivity tests based upon difference-of-convex (d.c.) decompositions, and combine them to a branch-and-bound algorithm of $\omega$-subdivision type. The tests employ LP or convex QP techniques, but also can be used heuristically using appropriate test points. We also discuss the selection of efficient d.c.~decompositions and propose some preprocessing ideas based on the spectral d.c.~decomposition. We report on first numerical experience with this procedure which are very promising. Keywords: copositive programming Category 1: Linear, Cone and Semidefinite Programming (Other ) Citation: AM Preprint Series No. 333, Univ. Erlangen-Nuremberg; and Technical Report 2011-05, ISOR, Univ. Wien. To appear in: Math. Programming A Download: [PDF]Entry Submitted: 01/14/2010Entry Accepted: 01/14/2010Entry Last Modified: 04/22/2012Modify/Update this entry Visitors Authors More about us Links Subscribe, Unsubscribe Digest Archive Search, Browse the Repository Submit Update Policies Coordinator's Board Classification Scheme Credits Give us feedback Optimization Journals, Sites, Societies Optimization Online is supported by the Mathematical Optmization Society.