Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision

DOI10.1007/s10107-012-0543-xzbMath1267.65060OpenAlexW2088564876MaRDI QIDQ1949258

Immanuel M. Bomze, Gabriele Eichfelder

Publication date: 6 May 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0543-x

zbMATH Keywords

algorithmnumerical examplesquadratic optimizationlinear optimizationbranch and bound algorithmconic optimizationcopositivity testingspectral difference-of-convex decomposition

Mathematics Subject Classification ID

Related Items (18)

LP-based tractable subcones of the semidefinite plus nonnegative cone ⋮ Testing copositivity with the help of difference-of-convex optimization ⋮ On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets ⋮ Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA ⋮ A new certificate for copositivity ⋮ Copositivity and constrained fractional quadratic problems ⋮ Copositive optimization -- recent developments and applications ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ An improved algorithm to test copositivity ⋮ Conic formulation of QPCCs applied to truly sparse QPs ⋮ On the exhaustivity of simplicial partitioning ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ Copositivity and sparsity relations using spectral properties ⋮ Quadratic factorization heuristics for copositive programming ⋮ A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors ⋮ Copositivity tests based on the linear complementarity problem ⋮ A modified simplex partition algorithm to test copositivity ⋮ Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Copositive optimization -- recent developments and applications
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
• Perron-Frobenius property of copositive matrices, and a block copositivity criterion
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
• Algorithms for determining the copositivity of a given symmetric matrix
• Convex programs with an additional reverse convex constraint
• Criteria for copositive matrices
• On standard quadratic optimization problems
• Using copositivity for global optimality criteria in concave quadratic programming problems
• Global escape strategies for maximizing quadratic forms over a simplex
• Quadratic-programming criteria for copositive matrices
• Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
• Criteria for copositive matrices using simplices and barycentric coordinates
• Introduction to global optimization
• On copositive matrices with -1, 9, 1 entries
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Algorithmic copositivity detection by simplicial partition
• Two remarks on copositive matrices
• Block pivoting and shortcut strategies for detecting copositivity
• The copositive completion problem
• Approximation of the Stability Number of a Graph via Copositive Programming
• Copositive Programming
• Depth-first simplicial partition for copositivity detection, with an application to MaxClique
• On generalized bisection of 𝑛-simplices
• Some NP-complete problems in quadratic and nonlinear programming
• Copositive realxation for genera quadratic programming
• Linear-Time Copositivity Detection for Tridiagonal Matrices and Extension to Block-Tridiagonality
• Foundations of Set-Semidefinite Optimization
• On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• A copositivity probe

This page was built for publication: Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision