Hongwei Jiao
School of Mathematical Science, Henan Institute of Science and Technology, Xinxiang, 453003, China
Lin Wang
Department of Basic Science, Henan Mechanical and Electrical Engineering College, Xinxiang, 453002, China
Jianping Wang
School of Mathematical Science, Henan Institute of Science and Technology, Xinxiang, 453003, China
ABSTRACT
In this study, a deterministic global optimization algorithm is proposed for globally solving the Nonconvex Quadratic Programming (NQP). In this algorithm, by using the characteristic of the NQP, a new linearization approach is presented. By utilizing the approach, the linear programming relaxation problem of the NQP is established. The proposed deterministic algorithm is convergent to the global optimum of the NQP by solving a series of linear programming relaxation problems. Compared with the known approaches, numerical results demonstrate the effectiveness of the proposed algorithm.
PDF References Citation
How to cite this article
Hongwei Jiao, Lin Wang and Jianping Wang, 2013. A Deterministic Global Optimization Algorithm. Information Technology Journal, 12: 6986-6991.
DOI: 10.3923/itj.2013.6986.6991
URL: https://scialert.net/abstract/?doi=itj.2013.6986.6991
DOI: 10.3923/itj.2013.6986.6991
URL: https://scialert.net/abstract/?doi=itj.2013.6986.6991
REFERENCES
- Burer, S. and D. Vandenbussche, 2008. A finite branch-and-bound algorithm for non-convex quadratic programming via semidefinite relaxations. Math. Prog., 113: 259-282.
CrossRef - Chai, H. and W. Chen, 2013. Uncertainty analysis by monte carlo simulation in a life cycle assessment of water-saving project in green buildings. Inf. Technol. J., 12: 2593-2598.
Direct Link - Jiao, H. and Y. Chen, 2013. A global optimization algorithm for generalized quadratic programming. J. Applied Math., Vol. 2013.
CrossRef - Linderoth, J., 2005. A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math. Program., 103: 251-282.
CrossRef - Shen, P. and H. Jiao, 2006. A new rectangle branch-and-pruning approach for generalized geometric programming. Applied Math. Comput., 183: 1027-1038.
CrossRef - Shen, P. and X. Li, 2013. Branch reduction bound algorithm for generalized geometric programming. J. Glob. Optimization, 56: 1123-1142.
CrossRef - Sherali, H.D. and C.H. Tuncbilek, 1995. A reformulation convexification approach for solving nonconvex quadratic programming problems. J. Global Optimization, 7: 1-31.
CrossRef - Thoai, N.V., 2000. Duality bound method for the general quadratic programming problem with quadratic constraints. J. Optimization Theory Appl., 107: 331-354.
CrossRef - Voorhis, T.V., 2002. A global optimization algorithm using lagrangian underestimates and the interval newton method. J. Global Optimization, 24: 349-370.
CrossRef - Wu, W., J.G. Jiang and H. Liu, 2013. General optimization algorithm for capacitor voltage balance of multilevel inverters. Inf. Technol. J., 12: 2382-2389.
CrossRefDirect Link - Zhang, S., 2013. Optimizing the filling time and gate of the injection mold on plastic air intake manifold of engines. Inform. Technol. J., 12: 2473-2480.
CrossRef - Zheng, X.J., X.L. Sun and D. Li, 2011. Convex relaxations for non-convex quadratically constrained quadratic programming: Matrix cone decomposition and polyhedral approximation. Math. Program., 129: 301-329.
CrossRef