Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
Authors:
- 31 October 2007
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 43 (2) , 181-195
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Solving Lift-and-Project Relaxations of Binary Integer ProgramsSIAM Journal on Optimization, 2006
- A Semidefinite Programming Heuristic for Quadratic Programming Problems with Complementarity ConstraintsComputational Optimization and Applications, 2005
- Solving large quadratic assignment problems on computational gridsMathematical Programming, 2002
- Numerical Methods for Large-Scale Non-Convex Quadratic Programming2002
- Fixing Variables in Semidefinite RelaxationsSIAM Journal on Matrix Analysis and Applications, 2000
- A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic ProblemsJournal of Global Optimization, 1998
- Quadratic Programming with Box Constraints1997
- 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
- Nonconvex quadratic programs, linear complementarity problems, and integer linear programs1973