The bounds of feasible space on constrained nonconvex quadratic programming

✍ Scribed by Jinghao Zhu

• Publisher: Elsevier Science
• Year: 2008
• Tongue: English
• Weight: 135 KB
• Volume: 213
• Category: Article
• ISSN: 0377-0427
• DOI: 10.1016/j.cam.2007.01.010

✦ Synopsis

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, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373-395]. It is proposed that one applies this method for using the canonical dual transformation [D.Y. Gao, Canonical duality theory and solutions to constrained nonconvex quadratic programming, J. Global Optimization 29 (2004) 377-399] for solving a standard quadratic programming problem.