Depth-first simplicial partition for copositivity detection, with an application to MaxClique
From MaRDI portal
Publication:3093056
DOI10.1080/10556788.2010.544310zbMath1226.65037OpenAlexW2142029314MaRDI QIDQ3093056
Publication date: 12 October 2011
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2010.544310
algorithmnumerical resultscopositive matricessimplicial partitioncopositivity detectioncombinatorial and quadratic optimizationMaxClique
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
On monotonicity and search strategies in face-based copositivity detection algorithms ⋮ LP-based tractable subcones of the semidefinite plus nonnegative cone ⋮ Hermitian completely positive matrices ⋮ Copositive optimization -- recent developments and applications ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision ⋮ On the exhaustivity of simplicial partitioning ⋮ A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem ⋮ Copositivity tests based on the linear complementarity problem ⋮ Multi-objective optimization and decision visualization of batch stirred tank reactor based on spherical catalyst particles ⋮ A modified simplex partition algorithm to test copositivity ⋮ Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
Uses Software
Cites Work
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Perron-Frobenius property of copositive matrices, and a block copositivity criterion
- Algorithms for determining the copositivity of a given symmetric matrix
- A heuristic approach for the max-min diversity problem based on max-clique
- Branch and bound algorithm for multidimensional scaling with city-block metric
- Criteria for copositive matrices
- Test case generators and computational results for the maximum clique problem
- A test for copositive matrices
- Criteria for copositive matrices using simplices and barycentric coordinates
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Algorithmic copositivity detection by simplicial partition
- Block pivoting and shortcut strategies for detecting copositivity
- Approximation of the Stability Number of a Graph via Copositive Programming
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Some NP-complete problems in quadratic and nonlinear programming
- Keller’s cube-tiling conjecture is false in high dimensions
- Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem
- A Copositive Programming Approach to Graph Partitioning
- A branch and bound algorithm for the maximum clique problem
- A copositivity probe
This page was built for publication: Depth-first simplicial partition for copositivity detection, with an application to MaxClique
