A new bound-and-reduce approach of nonconvex quadratic programming problems
DOI10.1016/J.AMC.2014.10.077zbMATH Open1328.90096OpenAlexW2060254153MaRDI QIDQ902837FDOQ902837
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
global optimizationrelaxation techniquebranch-and-boundnonconvex quadratic programminghyper-rectangle reducing
Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Some NP-complete problems in quadratic and nonlinear programming
- Constrained global optimization: algorithms and applications
- Global optimization of signomial geometric programming using linear relaxation.
- Introduction to global optimization
- Global optimization of multiplicative programs
- A branch-and-reduce approach to global optimization
- Linearization method of global optimization for generalized geometric programming
- Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- A finite algorithm for solving general quadratic problems
- An algorithm for global minimization of linearly constrained quadratic functions
- Global minimization of a difference of two convex functions
- Checking local optimality in constrained quadratic programming is NP- hard
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- A parallel algorithm for constrained concave quadratic global minimization
- Bilinear programming and structured stochastic games
Cited In (7)
- A reduced proximal-point homotopy method for large-scale non-convex BQP
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- A new rectangle branch-and-reduce 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
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
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)
