Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
type: Item
instance of: scholarly article
title: Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
zbMATH Open document ID: 1225.90094
author: Yong Xia
publication date: 2011-11-04T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 49N15
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5968221
zbMATH Keywords: nonconvex programming
zbMATH Keywords: quadratically constrained quadratic programming
zbMATH Keywords: quadratic assignment problem
zbMATH Keywords: polynomial solvability
zbMATH Keywords: strong duality
MaRDI profile type: Publication
full work available at URL: s10114-011-8351-4
OpenAlex ID: W2112847829
cites work: Recent advances in the solution of quadratic assignment problems
cites work: The quadratic assignment problem. Theory and algorithms
cites work: A survey for the quadratic assignment problem
cites work: New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problems
cites work: An efficient continuation method for quadratic assignment problems
cites work: P-Complete Approximation Problems
cites work: Second order cone programming relaxation for quadratic assignment problems
cites work: Q3747197
cites work: A New Lower Bound Via Projection for the Quadratic Assignment Problem
cites work: Q4321556
cites work: Strong duality for a trust-region type relaxation of the quadratic assignment problem
cites work: On Lagrangian relaxation of quadratic matrix constraints
DOI: 10.1007/S10114-011-8351-4
published in: Acta Mathematica Sinica, English Series
description: scientific article; zbMATH DE number 5968221