A linearization method for global optimal solution of quadratic programming problem with nonconvex quadratic constraints
From MaRDI portal
Publication:5320249
zbMATH Open1174.65421MaRDI QIDQ5320249FDOQ5320249
Publication date: 22 July 2009
Recommendations
- A global optimization approach for quadratic programs with nonconvex quadratic constraints
- scientific article; zbMATH DE number 5630592
- An accelerating algorithm for globally solving nonconvex quadratic programming
- Global optimization of quadratic programming problems with quadratic constraints
- A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints
global optimizationnumerical examplesconvergence accelerationbranch and boundnonconvex quadratic programmingregion-deleting rules
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cited In (6)
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A linearization method for global optimal solution of quadratic programming problem with nonconvex quadratic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5320249)
