An improved algorithm to test copositivity
From MaRDI portal
Publication:427387
DOI10.1007/s10898-011-9766-2zbMath1250.65061MaRDI QIDQ427387
Mirjam Dür, Stefan Bundfuss, Julia Sponsel
Publication date: 13 June 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9766-2
algorithm; numerical results; semidefinite programming; testing; maximum clique problem; copositivity of a matrix; partitioning strategy
90C22: Semidefinite programming
15B48: Positive matrices and their generalizations; cones of matrices
90C09: Boolean programming
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
15A63: Quadratic and bilinear forms, inner products
Related Items
A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors, Dynamical Systems Coupled with Monotone Set-Valued Operators: Formalisms, Applications, Well-Posedness, and Stability, Copositivity tests based on the linear complementarity problem, Optimization under uncertainty and risk: quadratic and copositive approaches, Performance comparison of two recently proposed copositivity tests, Analysis of copositive optimization based linear programming bounds on standard quadratic optimization, Copositive tensor detection and its applications in physics and hypergraphs, LP-based tractable subcones of the semidefinite plus nonnegative cone, Copositivity detection of tensors: theory and algorithm, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem, A new algorithm for concave quadratic programming, A modified simplex partition algorithm to test copositivity, Testing copositivity via mixed-integer linear programming, Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations, On copositiveness identification of partially symmetric rectangular tensors, Exploiting symmetry in copositive programs via semidefinite hierarchies, Lyapunov stability for piecewise affine systems via cone-copositivity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Copositive optimization -- recent developments and applications
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- On standard quadratic optimization problems
- Evolution towards the maximum clique
- Conditionally definite matrices
- Annealed replication: A new heuristic for the maximum clique problem
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Algorithmic copositivity detection by simplicial partition
- Approximation of the Stability Number of a Graph via Copositive Programming
- A Variational Approach to Copositive Matrices
- On generalized bisection of 𝑛-simplices
- Some NP-complete problems in quadratic and nonlinear programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- On copositive programming and standard quadratic optimization problems
