Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
From MaRDI portal
Publication:1949258
DOI10.1007/s10107-012-0543-xzbMath1267.65060MaRDI 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
algorithm; numerical examples; quadratic optimization; linear optimization; branch and bound algorithm; conic optimization; copositivity testing; spectral difference-of-convex decomposition
65K05: Numerical mathematical programming methods
90C22: Semidefinite programming
90C25: Convex programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C20: Quadratic programming
90C05: Linear programming
15B48: Positive matrices and their generalizations; cones of matrices
Related Items
A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors, Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA, Copositivity tests based on the linear complementarity problem, Testing copositivity with the help of difference-of-convex optimization, On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets, 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, Copositivity and sparsity relations using spectral properties, Quadratic factorization heuristics for copositive programming, LP-based tractable subcones of the semidefinite plus nonnegative cone, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, A modified simplex partition algorithm to test copositivity, Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme, A new certificate for copositivity, On the exhaustivity of simplicial partitioning, Conic formulation of QPCCs applied to truly sparse QPs
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
