On the copositive representation of binary and continuous nonconvex quadratic programs
Author:
Top Cited Papers
- 29 April 2008
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 120 (2) , 479-495
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Computable representations for convex hulls of low-dimensional quadratic formsMathematical Programming, 2010
- An Adaptive Linear Approximation Algorithm for Copositive ProgramsSIAM Journal on Optimization, 2009
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxationsMathematical Programming, 2006
- A PTAS for the minimization of polynomials of fixed degree over the simplexTheoretical Computer Science, 2006
- Maximum stable set formulations and heuristics based on continuous optimizationMathematical Programming, 2002
- Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive ProgrammingJournal of Global Optimization, 2002
- Approximation of the Stability Number of a Graph via Copositive ProgrammingSIAM Journal on Optimization, 2002
- On Copositive Programming and Standard Quadratic Optimization ProblemsJournal of Global Optimization, 2000
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- Nonconvex quadratic programs, linear complementarity problems, and integer linear programs1973