Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
From MaRDI portal
(Redirected from Publication:644622)
Recommendations
- An efficient method for non-convex QCQP problems
- Global optimization of quadratic programming problems with quadratic constraints
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
- A global optimization approach for quadratic programs with nonconvex quadratic constraints
- A global optimization algorithm for generalized quadratic programming
Cites work
- scientific article; zbMATH DE number 3982880 (Why is no real title available?)
- scientific article; zbMATH DE number 714535 (Why is no real title available?)
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- A survey for the quadratic assignment problem
- An efficient continuation method for quadratic assignment problems
- New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problems
- On Lagrangian relaxation of quadratic matrix constraints
- P-Complete Approximation Problems
- Recent advances in the solution of quadratic assignment problems
- Second order cone programming relaxation for quadratic assignment problems
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- The quadratic assignment problem. Theory and algorithms
Cited in
(13)- Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
- A monotonicity based approach to nonconvex quadratic minimization
- scientific article; zbMATH DE number 205727 (Why is no real title available?)
- An efficient method for non-convex QCQP problems
- Convex hull presentation of A quadratically constrained set and its application in solving quadratic programming problems
- scientific article; zbMATH DE number 1051015 (Why is no real title available?)
- A survey of hidden convex optimization
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Exact dual bounds for some nonconvex minimax quadratic optimization problems
- scientific article; zbMATH DE number 2068052 (Why is no real title available?)
- Minimizing the object space error for pose estimation: towards the most efficient algorithm
- Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
This page was built for publication: Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644622)
