Author:
Zhou Jing,Fang Shu-Cherng,Xing Wenxun
Funder
National Natural Science Foundation of China
Army Research Office
National Natural Science Foundation of Chin
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference38 articles.
1. Arima, N., Kim, S., Kojima, M.: Simplified copositive and lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables. Pac. J. Optim. 10(3), 437–451 (2013)
2. Bai, L., Mitchell, J.E., Pang, J.S.: On convex quadratic programs with linear complementarity constraints. Comput. Optim. Appl. 54(3), 517–554 (2013)
3. Bai, L., Mitchell, J.E., Pang, J.S.: On conic QPCCs, conic QCQPs and completely positive programs. Math. Program. Ser. A (2015)
4. Beasley, J.E.: Heuristic algorithms for the unconstrained binary quadratic programming problem. Technical report (1998)
5. Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization, Analysis, Algorithms and Engineering Applications. MPS/SIAM Series on Optimization, 1st edn. SIAM, Philadelphia (2001)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献