Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
DOI10.1007/S10114-011-8351-4zbMATH Open1225.90094OpenAlexW2112847829MaRDI QIDQ644622FDOQ644622
Authors: Yong Xia 
Publication date: 4 November 2011
Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-011-8351-4
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
quadratic assignment problemnonconvex programmingstrong dualitypolynomial solvabilityquadratically constrained quadratic programming
Quadratic programming (90C20) Combinatorial optimization (90C27) Duality theory (optimization) (49N15)
Cites Work
- The quadratic assignment problem. Theory and algorithms
- Title not available (Why is that?)
- P-Complete Approximation Problems
- A survey for the quadratic assignment problem
- Recent advances in the solution of quadratic assignment problems
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- On Lagrangian relaxation of quadratic matrix constraints
- Second order cone programming relaxation for quadratic assignment problems
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problems
- An efficient continuation method for quadratic assignment problems
- Title not available (Why is that?)
Cited In (13)
- Title not available (Why is that?)
- A monotonicity based approach to nonconvex quadratic minimization
- Title not available (Why is that?)
- Exact dual bounds for some nonconvex minimax quadratic optimization problems
- Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs
- A survey of hidden convex optimization
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- Convex hull presentation of A quadratically constrained set and its application in solving quadratic programming problems
- An efficient method for non-convex QCQP problems
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Minimizing the object space error for pose estimation: towards the most efficient algorithm
- Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
- Title not available (Why is that?)
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)
