Performance comparison of two recently proposed copositivity tests
From MaRDI portal
Publication:6114943
DOI10.1016/j.ejco.2022.100037zbMath1530.90070OpenAlexW4289597247MaRDI QIDQ6114943
Publication date: 12 July 2023
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejco.2022.100037
Mixed integer programming (90C11) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Positive matrices and their generalizations; cones of matrices (15B48)
Cites Work
- Copositive optimization -- recent developments and applications
- An improved algorithm to test copositivity
- Branch-and-bound approaches to standard quadratic optimization problems
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Testing copositivity via mixed-integer linear programming
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- On copositive matrices with -1, 9, 1 entries
- A gentle, geometric introduction to copositive optimization
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A new certificate for copositivity
- Algorithmic copositivity detection by simplicial partition
- Some NP-complete problems in quadratic and nonlinear programming
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- On copositive programming and standard quadratic optimization problems
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
This page was built for publication: Performance comparison of two recently proposed copositivity tests
