References in zbMATH (referenced in 15 articles )

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

  1. Kuang, Xiaolong; Zuluaga, Luis F.: Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (2018)
  2. Edirisinghe, Chanaka; Jeong, Jaehwan: Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (2017)
  3. Lu, Cheng; Deng, Zhibin; Jin, Qingwei: An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (2017)
  4. Puranik, Yash; Sahinidis, Nikolaos V.: Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (2017)
  5. Dong, Hongbo: Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations (2016)
  6. Edirisinghe, Chanaka; Jeong, Jaehwan: An efficient global algorithm for a class of indefinite separable quadratic programs (2016)
  7. Fan, Jinyan; Zhou, Anwa: The CP-matrix approximation problem (2016)
  8. Kellner, Kai; Theobald, Thorsten: Sum of squares certificates for containment of $\mathcalH$-polytopes in $\mathcalV$-polytopes (2016)
  9. Locatelli, Marco: Exactness conditions for an SDP relaxation of the extended trust region problem (2016)
  10. Bomze, Immanuel M.: Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems (2015)
  11. Dobre, Cristian; Vera, Juan: Exploiting symmetry in copositive programs via semidefinite hierarchies (2015)
  12. Dong, Yang; Thiele, Aurélie: Robust investment management with uncertainty in fund managers’ asset allocation (2015)
  13. Misener, Ruth; Smadbeck, James B.; Floudas, Christodoulos A.: Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (2015)
  14. Peña, Javier; Vera, Juan C.; Zuluaga, Luis F.: Completely positive reformulations for polynomial optimization (2015)
  15. Chen, Jieqiu; Burer, Samuel: Globally solving nonconvex quadratic programming problems via completely positive programming (2012)