On monotonicity and search strategies in face-based copositivity detection algorithms
From MaRDI portal
Publication:2155140
DOI10.1007/S10100-021-00737-6OpenAlexW3134034467MaRDI QIDQ2155140FDOQ2155140
Authors: Boglárka G.-Tóth, E. M. T. Hendrix, L. G. Casado 
Publication date: 15 July 2022
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-021-00737-6
Cites Work
- Some NP-complete problems in quadratic and nonlinear programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Criteria for copositive matrices
- A test for copositive matrices
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Algorithmic copositivity detection by simplicial partition
- A clique algorithm for standard quadratic programming
- Title not available (Why is that?)
- A Copositive Programming Approach to Graph Partitioning
- Algorithms for determining the copositivity of a given symmetric matrix
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- A new branch-and-bound algorithm for standard quadratic programming problems
- A new semidefinite programming bound for indefinite quadratic forms over a simplex
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
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)
