On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
From MaRDI portal
Publication:3105771
DOI10.1137/100802153zbMath1236.90083OpenAlexW2060164631WikidataQ57445454 ScholiaQ57445454MaRDI QIDQ3105771
Xiaoling Sun, Yong Xia, Li, Duan, Xiao Jin Zheng
Publication date: 9 January 2012
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100802153
linear equality constraintssemidefinite relaxationbox constrained quadratic programreduction of duality gap
Semidefinite programming (90C22) Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46)
Related Items (5)
Tightening a copositive relaxation for standard quadratic optimization problems ⋮ New semidefinite programming relaxations for box constrained quadratic program ⋮ A survey of hidden convex optimization ⋮ Improved estimation of duality gap in binary quadratic programming using a weighted distance measure ⋮ Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
Uses Software
This page was built for publication: On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
