Computable representations for convex hulls of low-dimensional quadratic forms
- 11 May 2010
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 124 (1-2), 33-43
- https://doi.org/10.1007/s10107-010-0355-9
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programmingJournal of Global Optimization, 2008
- On the copositive representation of binary and continuous nonconvex quadratic programsMathematical Programming, 2008
- The Convex Envelope of (n–1)-Convex FunctionsSIAM Journal on Optimization, 2008
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programsMathematical Programming, 2005
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraintsMathematical Programming, 2004
- BARON: A general purpose global optimization software packageJournal of Global Optimization, 1996
- A reformulation-convexification approach for solving nonconvex quadratic programming problemsJournal of Global Optimization, 1995
- Characterization of completely positive graphsDiscrete Mathematics, 1993
- A new reformulation-linearization technique for bilinear programming problemsJournal of Global Optimization, 1992
- Maxima for Graphs and a New Proof of a Theorem of TuránCanadian Journal of Mathematics, 1965