A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems

Abstract

The paper presents a new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems, in which a new lower approximate linear functions of the quadratic function over an n-rectangle is given to determine a lower bound of the global optimal value of the original problem over each rectangle, and a simple two-partition technique… (More)
DOI: 10.1016/j.amc.2004.10.024

Topics

1 Figure or Table

Cite this paper

@article{Gao2005ANR, title={A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems}, author={Yuelin Gao and Honggang Xue and Peiping Shen}, journal={Applied Mathematics and Computation}, year={2005}, volume={168}, pages={1409-1418} }