On monotonicity and search strategies in face-based copositivity detection algorithms
From MaRDI portal
Publication:2155140
Recommendations
Cites work
- A clique algorithm for standard quadratic programming
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- A Copositive Programming Approach to Graph Partitioning
- A new branch-and-bound algorithm for standard quadratic programming problems
- A new semidefinite programming bound for indefinite quadratic forms over a simplex
- A test for copositive matrices
- Algorithmic copositivity detection by simplicial partition
- Algorithms for determining the copositivity of a given symmetric matrix
- Criteria for copositive matrices
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- scientific article; zbMATH DE number 3201668 (Why is no real title available?)
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Some NP-complete problems in quadratic and nonlinear programming
Cited in
(2)
This page was built for publication: On monotonicity and search strategies in face-based copositivity detection algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155140)