Publication Date:
2020-10-07
Description:
Standard quadratic optimization problems (StQPs) are NP-hard in computational complexity theory when the matrix is indefinite. This paper describes an approximate algorithm of finding inner optimal values of StQPs. The approximate algorithm fuzzifies variable x ∈ Rn with normalized possibility distributions and simplifies the solving of StQPs. The approximation ratio is discussed and determined. Numerical results show that (1) the new algorithm achieves higher accuracy than the semidefinite programming method and linear programming approximation method; (2) the novel algorithm consumes less than one out of fourth computational time that is consumed by linear programming approximation method; (3) the computational time of the new algorithm does not correlate with the matrix densities whereas the computational times of the branch-and-bound and heuristic algorithms do.
Print ISSN:
1064-1246
Electronic ISSN:
1875-8967
Topics:
Mathematics
Permalink
