An LPCC approach to nonconvex quadratic programs
- 9 November 2010
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 133 (1-2) , 243-277
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- On the Global Solution of Linear Programs with Linear Complementarity ConstraintsSIAM Journal on Optimization, 2008
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-boundComputational Optimization and Applications, 2007
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxationsMathematical Programming, 2006
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraintsMathematical Programming, 2004
- A polyhedral study of nonconvex quadratic programs with box constraintsMathematical Programming, 2004
- On the global minimization of the value-at-riskOptimization Methods and Software, 2004
- New algorithms for nonlinear generalized disjunctive programmingComputers & Chemical Engineering, 2000
- A symmetrical linear maxmin approach to disjoint bilinear programmingMathematical Programming, 1999
- MINTO, a mixed INTeger optimizerOperations Research Letters, 1994
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956