A new bound-and-reduce approach of nonconvex quadratic programming problems

DOI10.1016/j.amc.2014.10.077zbMath1328.90096OpenAlexW2060254153MaRDI QIDQ902837

Fei Wei, Yuelin Gao

Publication date: 4 January 2016

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

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

zbMATH Keywords

global optimizationbranch-and-boundnonconvex quadratic programmingrelaxation techniquehyper-rectangle reducing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (2)

Solving generalized polynomial problem by using new affine relaxed technique ⋮ Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs

Cites Work

• Unnamed Item
• Bilinear programming and structured stochastic games
• 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
• Global optimization of signomial geometric programming using linear relaxation.
• An algorithm for global minimization of linearly constrained quadratic functions
• Linearization method of global optimization for generalized geometric programming
• Introduction to global optimization
• A branch-and-reduce approach to global optimization
• A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Global minimization of a difference of two convex functions
• Some NP-complete problems in quadratic and nonlinear programming
• Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem

This page was built for publication: A new bound-and-reduce approach of nonconvex quadratic programming problems