Similar Search Results

Narrow search

On zero duality gap in nonconvex quadratic programming problems

Zheng, X.; Sun, X.; Li, D.; Xu, Y. - In: Journal of Global Optimization 52 (2012) 2, pp. 229-242

Persistent link: https://www.econbiz.de/10010896398

An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach

Li, D.; Sun, X.; Liu, C. - In: Journal of Global Optimization 52 (2012) 4, pp. 797-829

Persistent link: https://www.econbiz.de/10010845828

On duality gap in binary quadratic programming

Sun, X.; Liu, C.; Li, D.; Gao, J. - In: Journal of Global Optimization 53 (2012) 2, pp. 255-269

Persistent link: https://www.econbiz.de/10010845836

On reduction of duality gap in quadratic knapsack problems

Zheng, X.; Sun, X.; Li, D.; Xu, Y. - In: Journal of Global Optimization 54 (2012) 2, pp. 325-339

We investigate in this paper the duality gap between quadratic knapsack problem and its Lagrangian dual or semidefinite programming relaxation. We characterize the duality gap by a distance measure from set {0, 1}<Superscript> n </Superscript> to certain polyhedral set and demonstrate that the duality gap can be reduced...</superscript>

Persistent link: https://www.econbiz.de/10010994054

Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations

Zheng, X.; Sun, X.; Li, D. - In: Journal of Global Optimization 50 (2011) 4, pp. 695-712

Persistent link: https://www.econbiz.de/10009324672

Global descent methods for unconstrained global optimization

Wu, Z.; Li, D.; Zhang, L. - In: Journal of Global Optimization 50 (2011) 3, pp. 379-396

Persistent link: https://www.econbiz.de/10009149553