On zero duality gap in nonconvex quadratic programming problems
From MaRDI portal
Publication:421278
DOI10.1007/s10898-011-9660-yzbMath1266.90151WikidataQ57445448 ScholiaQ57445448MaRDI QIDQ421278
Publication date: 23 May 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9660-y
SDP relaxation; duality gap; sufficient conditions; Lagrangian dual; cell enumeration; nonconvex quadratic program
90C26: Nonconvex programming, global optimization
90C20: Quadratic programming
90C46: Optimality conditions and duality in mathematical programming