References in zbMATH (referenced in 36 articles )

1. Ding, Xiaodong; Luo, Hezhi; Wu, Huixian; Liu, Jianzhen: An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (2021)
2. Liuzzi, G.; Locatelli, M.; Piccialli, V.; Rass, S.: Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems (2021)
3. Luo, Hezhi; Ding, Xiaodong; Peng, Jiming; Jiang, Rujun; Li, Duan: Complexity results and effective algorithms for worst-case linear optimization under uncertainties (2021)
4. Bienstock, Daniel; Chen, Chen; Muñoz, Gonzalo: Outer-product-free sets for polynomial optimization and oracle-based cuts (2020)
5. Gourtani, Arash; Nguyen, Tri-Dung; Xu, Huifu: A distributionally robust optimization approach for two-stage facility location problems (2020)
6. Madani, Ramtin; Kheirandishfard, Mohsen; Lavaei, Javad; Atamtürk, Alper: Penalized semidefinite programming for quadratically-constrained quadratic optimization (2020)
7. Telli, Mohamed; Bentobache, Mohand; Mokhtari, Abdelkader: A successive linear approximation algorithm for the global minimization of a concave quadratic program (2020)
8. Xia, Wei; Vera, Juan C.; Zuluaga, Luis F.: Globally solving nonconvex quadratic programs via linear integer programming techniques (2020)
9. Bonami, Pierre; Lodi, Andrea; Schweiger, Jonas; Tramontani, Andrea: Solving quadratic programming by cutting planes (2019)
10. Elloumi, Sourour; Lambert, Amélie: Global solution of non-convex quadratically constrained quadratic programs (2019)
11. Lu, Cheng; Deng, Zhibin; Zhou, Jing; Guo, Xiaoling: A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (2019)
12. Luo, Hezhi; Bai, Xiaodi; Lim, Gino; Peng, Jiming: New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (2019)
13. Zamani, Moslem: A new algorithm for concave quadratic programming (2019)
14. Bonami, Pierre; Günlük, Oktay; Linderoth, Jeff: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (2018)
15. Galli, Laura; Letchford, Adam N.: A binarisation heuristic for non-convex quadratic programming with box constraints (2018)
16. Kuang, Xiaolong; Zuluaga, Luis F.: Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (2018)
17. Lu, Cheng; Deng, Zhibin: DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (2018)
18. Beck, Amir; Pan, Dror: A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (2017)
19. Berman, Abraham (ed.); Bomze, Immanuel M. (ed.); Dür, Mirjam (ed.); Shaked-Monderer, Naomi (ed.): Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (2017)
20. Chen, Chen; Atamtürk, Alper; Oren, Shmuel S.: A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (2017)