The bounds of feasible space on constrained nonconvex quadratic programming

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

卷:213

Article

Zhu, Jinghao

关键词: quadratic programming;    canonical dual theory;    linear programming;   

DOI  :  10.1016/j.cam.2007.01.010

来源: Elsevier

【 摘 要 】

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. (c) 2007 Elsevier B.V. All rights reserved.

【 授权许可】

Free