References in zbMATH (referenced in 147 articles )

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

1 2 3 ... 6 7 8 next

  1. Curchod, Florian J.; Johansson, Markus; Augusiak, Remigiusz; Hoban, Matty J.; Wittek, Peter; Acín, Antonio: A single entangled system Is an unbounded source of nonlocal correlations and of certified random numbers (2018)
  2. Gally, Tristan; Pfetsch, Marc E.; Ulbrich, Stefan: A framework for solving mixed-integer semidefinite programs (2018)
  3. Anderson, Peter D.; Kruczenski, Martin: Loop equations and bootstrap methods in the lattice (2017)
  4. Arima, Naohiko; Kim, Sunyoung; Kojima, Masakazu; Toh, Kim-Chuan: A robust Lagrangian-DNN method for a class of quadratic optimization problems (2017)
  5. Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie; Wiegele, Angelika: Using a conic bundle method to accelerate both phases of a quadratic convex reformulation (2017)
  6. Dostert, Maria; Guzmán, Cristóbal; de Oliveira Filho, Fernando Mário; Vallentin, Frank: New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry (2017)
  7. Lasserre, Jean B.: Computing Gaussian & exponential measures of semi-algebraic sets (2017)
  8. Magron, Victor; Constantinides, George; Donaldson, Alastair: Certified roundoff error bounds using semidefinite programming (2017)
  9. Sakaue, Shinsaku; Takeda, Akiko; Kim, Sunyoung; Ito, Naoki: Exact semidefinite programming relaxations with truncated moment matrix for binary polynomial optimization problems (2017)
  10. Bugarin, Florian; Henrion, Didier; Lasserre, Jean Bernard: Minimizing the sum of many rational functions (2016)
  11. De Santis, M.; Festa, P.; Liuzzi, G.; Lucidi, S.; Rinaldi, F.: A nonmonotone GRASP (2016)
  12. Diamond, Steven; Boyd, Stephen: Matrix-free convex optimization modeling (2016)
  13. Fantuzzi, G.; Goluskin, D.; Huang, D.; Chernyshenko, S. I.: Bounds for deterministic and stochastic dynamical systems using sum-of-squares optimization (2016)
  14. Friberg, Henrik A.: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (2016)
  15. Guzman, Yannis A.; Faruque Hasan, M. M.; Floudas, Christodoulos A.: Performance of convex underestimators in a branch-and-bound framework (2016)
  16. Kim, Sunyoung; Kojima, Masakazu; Toh, Kim-Chuan: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (2016)
  17. Klep, Igor; Povh, Janez: Constrained trace-optimization of polynomials in freely noncommuting variables (2016)
  18. Park, Sungwoo: A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence (2016)
  19. Bugarin, Florian; Bartoli, Adrien; Henrion, Didier; Lasserre, Jean-Bernard; Orteu, Jean-José; Sentenac, Thierry: Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (2015)
  20. Michal Kocvara, Michael Stingl: PENNON: Software for linear and nonlinear matrix inequalities (2015) arXiv

1 2 3 ... 6 7 8 next