A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- 12 December 2006
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 113 (2), 259-282
- https://doi.org/10.1007/s10107-006-0080-6
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Solving Lift-and-Project Relaxations of Binary Integer ProgramsSIAM Journal on Optimization, 2006
- Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related ProblemsJournal of Global Optimization, 2002
- Cones of Matrices and Successive Convex Relaxations of Nonconvex SetsSIAM Journal on Optimization, 2000
- Semidefinite relaxation and nonconvex quadratic optimizationOptimization Methods and Software, 1998
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Quadratic OptimizationNonconvex Optimization and Its Applications, 1995
- Global minimization of indefinite quadratic functions subject to box constraintsNaval Research Logistics (NRL), 1993
- Cones of Matrices and Set-Functions and 0–1 OptimizationSIAM Journal on Optimization, 1991
- Quadratic programming with one negative eigenvalue is NP-hardJournal of Global Optimization, 1991
- Global optimization algorithms for linearly constrained indefinite quadratic problemsComputers & Mathematics with Applications, 1991