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

DOI10.1016/j.amc.2004.10.024zbMath1087.65061OpenAlexW2043922364MaRDI QIDQ2572774

Honggang Xue, Pei-Ping Shen, Yuelin Gao

Publication date: 4 November 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.10.024

zbMATH Keywords

algorithmconvergence accelerationnumerical experimentsGlobal optimizationNonconvex quadratic programmingBranch-and-bound methodRectangle reducing tactics

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (6)

An accelerating algorithm for globally solving nonconvex quadratic programming ⋮ A parametric linearizing approach for quadratically inequality constrained quadratic programs ⋮ Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs ⋮ A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming ⋮ A new bound-and-reduce approach of nonconvex quadratic programming problems ⋮ A novel optimization method for nonconvex quadratically constrained quadratic programs

Cites Work

• Unnamed Item
• Unnamed Item
• Bilinear programming and structured stochastic games
• Global minimization of indefinite quadratic problems
• Constrained global optimization: algorithms and applications
• Checking local optimality in constrained quadratic programming is NP- hard
• A parallel algorithm for constrained concave quadratic global minimization
• A finite algorithm for solving general quadratic problems
• Global optimization of multiplicative programs
• An algorithm for global minimization of linearly constrained quadratic functions
• Introduction to global optimization
• Generalized Benders decomposition
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Some NP-complete problems in quadratic and nonlinear programming
• Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem
• The Indefinite Quadratic Programming Problem
• A Method for Solving the Indefinite Quadratic Programming Problem

This page was built for publication: A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems