References in zbMATH (referenced in 143 articles )

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

1 2 3 ... 6 7 8 next

  1. Anderson, Peter D.; Kruczenski, Martin: Loop equations and bootstrap methods in the lattice (2017)
  2. Arima, Naohiko; Kim, Sunyoung; Kojima, Masakazu; Toh, Kim-Chuan: A robust Lagrangian-DNN method for a class of quadratic optimization problems (2017)
  3. Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie; Wiegele, Angelika: Using a conic bundle method to accelerate both phases of a quadratic convex reformulation (2017)
  4. 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)
  5. Lasserre, Jean B.: Computing Gaussian & exponential measures of semi-algebraic sets (2017)
  6. Sakaue, Shinsaku; Takeda, Akiko; Kim, Sunyoung; Ito, Naoki: Exact semidefinite programming relaxations with truncated moment matrix for binary polynomial optimization problems (2017)
  7. Bugarin, Florian; Henrion, Didier; Lasserre, Jean Bernard: Minimizing the sum of many rational functions (2016)
  8. De Santis, M.; Festa, P.; Liuzzi, G.; Lucidi, S.; Rinaldi, F.: A nonmonotone GRASP (2016)
  9. Diamond, Steven; Boyd, Stephen: Matrix-free convex optimization modeling (2016)
  10. Fantuzzi, G.; Goluskin, D.; Huang, D.; Chernyshenko, S.I.: Bounds for deterministic and stochastic dynamical systems using sum-of-squares optimization (2016)
  11. Friberg, Henrik A.: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (2016)
  12. Guzman, Yannis A.; Faruque Hasan, M.M.; Floudas, Christodoulos A.: Performance of convex underestimators in a branch-and-bound framework (2016)
  13. 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)
  14. Klep, Igor; Povh, Janez: Constrained trace-optimization of polynomials in freely noncommuting variables (2016)
  15. Park, Sungwoo: A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence (2016)
  16. 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)
  17. Michal Kocvara, Michael Stingl: PENNON: Software for linear and nonlinear matrix inequalities (2015) arXiv
  18. Wittek, Peter: Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables (2015)
  19. Burgdorf, Sabine; Cafuta, Kristijan; Klep, Igor; Povh, Janez: The tracial moment problem and trace-optimization of polynomials (2013)
  20. Cummings, James; Král’, Daniel; Pfender, Florian; Sperfeld, Konrad; Treglown, Andrew; Young, Michael: Monochromatic triangles in three-coloured graphs (2013)

1 2 3 ... 6 7 8 next