[1]章显业,罗和治.带凸二次约束非凸二次规划的双非负规划松弛及其解法[J].浙江理工大学学报,2022,47-48(自科四):601-607.
　ZHANG Xianye,LUO Hezhi.Doubly non negative programming relaxation for non convex quadratic programming with convex quadratic constraint and its solution[J].Journal of Zhejiang Sci-Tech University,2022,47-48(自科四):601-607.

点击复制

带凸二次约束非凸二次规划的双非负规划松弛及其解法()

分享到：

参考文献/References:

［1］Pardalos P M, Vavasis S A. Quadratic programming with one negative eigenvalue is NPhard［J］. Journal of Global Optimization, 1991, 1(1): 15-22.

［2］Pardalos P M, Schnitger G. Checking local optimality in constrained quadratic programming is NPhard［J］. Operations Research Letters, 1988, 7(1): 33-35.

［3］申培萍. 全局优化方法［M］. 北京: 科学出版社, 2006: 195-241.

［4］Vandenbussche D, Nemhauser G L. A branchandcut algorithm for nonconvex quadratic programs with box constraints［J］. Mathematical Programming, 2005, 102(3): 559-575.

［5］Le Thi H A, Dinh T P. A branch and bound method via d.c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems［J］. Journal of Global Optimization, 1998, 13: 171-206.

［6］Hoai An L T. An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints［J］. Mathematical Programming, 2000, 87(3): 401-426.

［7］Barrientos O, Correa R. An algorithm for global minimization of linearly constrained quadratic functions［J］. J Global Optimization, 2000, 16(1): 77-93.

［8］Burer S, Vandenbussche D. A finite branchandbound algorithm for nonconvex quadratic programming via semidefinite relaxations［J］. Mathematical Programming, 2008, 113(2): 259-282.

［9］Luo H Z, Bai X D, Lim G, et al. New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation［J］. Mathematical Programming Computation, 2019, 11(1): 119-171.

［10］Anstreicher K M. Semidefinite programming versus the reformulationlinearization technique for nonconvex quadratically constrained quadratic programming［J］. Journal of Global Optimization, 2009, 43(2/3): 471-484.

相似文献/References:

[1]王建国,郑芳英,胡觉亮.求解单二次约束非凸二次规划问题的全局最优DC算法[J].浙江理工大学学报,2021,45-46(自科二):249.
　WANG Jianguo,ZHENG Fangying,HU Jueliang.A globally optimal DC algorithm for solving single quadratic constrained nonconvex quadratic programming problems[J].Journal of Zhejiang Sci-Tech University,2021,45-46(自科四):249.
[2]李叶,洪陈春,罗和治.两阶段金融衍生品清算问题的半定规划松弛方法[J].浙江理工大学学报,2024,51-52(自科四):566.
　LI Ye,HONG Chenchun,LUO Hezhi.The semi definite programming relaxation method for two period  financial derivatives′ liquidation problem[J].Journal of Zhejiang Sci-Tech University,2024,51-52(自科四):566.