References in zbMATH (referenced in 164 articles )

Showing results 21 to 40 of 164.
Sorted by year (citations)

previous 1 2 3 4 ... 7 8 9 next

  1. Lasserre, Jean B.: Computing Gaussian & exponential measures of semi-algebraic sets (2017)
  2. Magron, Victor; Constantinides, George; Donaldson, Alastair: Certified roundoff error bounds using semidefinite programming (2017)
  3. Sakaue, Shinsaku; Takeda, Akiko; Kim, Sunyoung; Ito, Naoki: Exact semidefinite programming relaxations with truncated moment matrix for binary polynomial optimization problems (2017)
  4. Beem, Christopher; Lemos, Madalena; Liendo, Pedro; Rastelli, Leonardo; van Rees, Balt C.: The ( \mathcalN=2 ) superconformal bootstrap (2016)
  5. Bugarin, Florian; Henrion, Didier; Lasserre, Jean Bernard: Minimizing the sum of many rational functions (2016)
  6. De Santis, M.; Festa, P.; Liuzzi, G.; Lucidi, S.; Rinaldi, F.: A nonmonotone GRASP (2016)
  7. Diamond, Steven; Boyd, Stephen: Matrix-free convex optimization modeling (2016)
  8. Fantuzzi, G.; Goluskin, D.; Huang, D.; Chernyshenko, S. I.: Bounds for deterministic and stochastic dynamical systems using sum-of-squares optimization (2016)
  9. Friberg, Henrik A.: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (2016)
  10. Guzman, Yannis A.; Faruque Hasan, M. M.; Floudas, Christodoulos A.: Performance of convex underestimators in a branch-and-bound framework (2016)
  11. 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)
  12. Klep, Igor; Povh, Janez: Constrained trace-optimization of polynomials in freely noncommuting variables (2016)
  13. Park, Sungwoo: A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence (2016)
  14. Balogh, József; Hu, Ping; Lidický, Bernard; Pikhurko, Oleg; Udvari, Balázs; Vplec, Jan: Minimum number of monotone subsequences of length 4 in permutations (2015)
  15. 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)
  16. Guo, Xu; Zhao, Xiaofang; Zhang, Weisheng; Yan, Jun; Sun, Guomin: Multi-scale robust design and optimization considering load uncertainties (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)

previous 1 2 3 4 ... 7 8 9 next