๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program

โœ Scribed by Xia, Yong; Sun, Xiaoling; Li, Duan; Zheng, Xiaojin


Book ID
118203689
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
259 KB
Volume
21
Category
Article
ISSN
1052-6234

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The bounds of feasible space on constrai
โœ Jinghao Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 135 KB

This paper presents a method to estimate the bounds of the radius of the feasible space for a class of constrained nonconvex quadratic programmings. Results show that one may compute a bound of the radius of the feasible space by a linear programming which is known to be a P -problem [N. Karmarkar,