A linearization method for global optimal solution of quadratic programming problem with nonconvex quadratic constraints
From MaRDI portal
Publication:5320249
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
Cited in
(10)- An accelerating algorithm for globally solving nonconvex quadratic programming
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- A global optimization approach for quadratic programs with nonconvex quadratic constraints
- An efficient method for non-convex QCQP problems
- 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
- Global optimization of quadratic programming problems with quadratic constraints
- scientific article; zbMATH DE number 1051015 (Why is no real title available?)
- scientific article; zbMATH DE number 5630592 (Why is no real title available?)
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)
