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

DOI10.1016/J.AMC.2014.10.077MaRDI QIDQ902837zbMATH OpenOpenAlexFDO

Authors Yuelin Gao, Fei Wei

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 optimizationrelaxation techniquebranch-and-boundnonconvex quadratic programminghyper-rectangle reducing

Mathematics Subject Classification ID

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

Recommendations

• A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
• A global optimization approach for quadratic programs with nonconvex quadratic constraints
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints
• scientific article; zbMATH DE number 6310870

Cites work

• A branch-and-reduce approach to global optimization
• A finite algorithm for solving general quadratic problems
• A new branch-and-bound algorithm for solving large-scale complex integer convex quadratic programming problems
• A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
• A parallel algorithm for constrained concave quadratic global minimization
• An algorithm for global minimization of linearly constrained quadratic functions
• Bilinear programming and structured stochastic games
• Checking local optimality in constrained quadratic programming is NP- hard
• Constrained global optimization: algorithms and applications
• Global minimization of a difference of two convex functions
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Global optimization of multiplicative programs
• Global optimization of signomial geometric programming using linear relaxation.
• Introduction to global optimization
• Linearization method of global optimization for generalized geometric programming
• Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem
• Some NP-complete problems in quadratic and nonlinear programming

Cited in

(9)

• Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
• A reduced proximal-point homotopy method for large-scale non-convex BQP
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem
• Solving generalized polynomial problem by using new affine relaxed technique
• A solver for nonconvex bound-constrained quadratic optimization
• A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
• Numerical solution of special problems of nonconvex quadratic programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q902837)