References in zbMATH (referenced in 41 articles )

Showing results 1 to 20 of 41.
Sorted by year (citations)

1 2 3 next

  1. Andjouh, Amar; Bibi, Mohand Ouamer: Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (2022)
  2. 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)
  3. Gondzio, Jacek; Yıldırım, E. Alper: Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (2021)
  4. 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)
  5. Luo, Hezhi; Chen, Sikai; Wu, Huixian: A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (2021)
  6. Luo, Hezhi; Ding, Xiaodong; Peng, Jiming; Jiang, Rujun; Li, Duan: Complexity results and effective algorithms for worst-case linear optimization under uncertainties (2021)
  7. Bienstock, Daniel; Chen, Chen; Muñoz, Gonzalo: Outer-product-free sets for polynomial optimization and oracle-based cuts (2020)
  8. Gourtani, Arash; Nguyen, Tri-Dung; Xu, Huifu: A distributionally robust optimization approach for two-stage facility location problems (2020)
  9. Madani, Ramtin; Kheirandishfard, Mohsen; Lavaei, Javad; Atamtürk, Alper: Penalized semidefinite programming for quadratically-constrained quadratic optimization (2020)
  10. Telli, Mohamed; Bentobache, Mohand; Mokhtari, Abdelkader: A successive linear approximation algorithm for the global minimization of a concave quadratic program (2020)
  11. Xia, Wei; Vera, Juan C.; Zuluaga, Luis F.: Globally solving nonconvex quadratic programs via linear integer programming techniques (2020)
  12. Zhou, Jing; Deng, Zhibin: A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (2020)
  13. Bonami, Pierre; Lodi, Andrea; Schweiger, Jonas; Tramontani, Andrea: Solving quadratic programming by cutting planes (2019)
  14. Elloumi, Sourour; Lambert, Amélie: Global solution of non-convex quadratically constrained quadratic programs (2019)
  15. Lu, Cheng; Deng, Zhibin; Zhou, Jing; Guo, Xiaoling: A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (2019)
  16. 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)
  17. Zamani, Moslem: A new algorithm for concave quadratic programming (2019)
  18. Bonami, Pierre; Günlük, Oktay; Linderoth, Jeff: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (2018)
  19. Galli, Laura; Letchford, Adam N.: A binarisation heuristic for non-convex quadratic programming with box constraints (2018)
  20. Kuang, Xiaolong; Zuluaga, Luis F.: Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (2018)

1 2 3 next