The bounds of feasible space on constrained nonconvex quadratic programming

Authors:
Jinghao Zhu
Affiliations:
Department of Mathematics, Tongji University, Shanghai 200092, China
Venue:
Journal of Computational and Applied Mathematics
Year:
2008

Citing 4
Cited 0

A new polynomial-time algorithm for linear programming

Combinatorica
Some NP-complete problems in quadratic and nonlinear programming

Mathematical Programming: Series A and B
Canonical Duality Theory and Solutions to Constrained Nonconvex Quadratic Programming

Journal of Global Optimization
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Quantified Score

Hi-index	7.29

Visualization

Abstract

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.