References in zbMATH (referenced in 20 articles )

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

  1. Puranik, Yash; Sahinidis, Nikolaos V.: Domain reduction techniques for global NLP and MINLP optimization (2017)
  2. Grimstad, Bjarne; Sandnes, Anders: Global optimization with spline constraints: a new branch-and-bound method based on B-splines (2016)
  3. Bussieck, Michael R.; Dirkse, Steven P.; Vigerske, Stefan: PAVER 2.0: an open source environment for automated performance analysis of benchmarking data (2014)
  4. Liberti, Leo; Ostrowski, James: Stabilizer-based symmetry breaking constraints for mathematical programs (2014)
  5. Zorn, Keith; Sahinidis, Nikolaos V.: Global optimization of general non-convex problems with intermediate bilinear substructures (2014)
  6. Ballerstein, Martin: Convex relaxations for mixed-integer nonlinear programs (2013)
  7. Pintér, János D.; Kampas, Frank J.: Benchmarking nonlinear optimization software in technical computing environments (2013)
  8. Chen, Jieqiu; Burer, Samuel: Globally solving nonconvex quadratic programming problems via completely positive programming (2012)
  9. Kim, Sunyoung; Kojima, Masakazu: Exploiting sparsity in SDP relaxation of polynomial optimization problems (2012)
  10. Liberti, Leo: Reformulations in mathematical programming: automatic symmetry detection and exploitation (2012)
  11. Nataraj, P. S. V.; Arounassalame, M.: Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (2011)
  12. Kleniati, Polyxeni-Margarita; Parpas, Panos; Rustem, Berç: Partitioning procedure for polynomial optimization (2010)
  13. Kim, Sunyoung; Kojima, Masakazu; Toint, Philippe: Recognizing underlying sparsity in optimization (2009)
  14. Smith, Andrew Paul: Fast construction of constant bound functions for sparse polynomials (2009)
  15. Kobayashi, Kazuhiro; Kim, Sunyoung; Kojima, Masakazu: Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (2008)
  16. Kobayashi, Kazuhiro; Nakata, Kazuhide; Kojima, Masakazu: A conversion of an SDP having free variables into the standard form SDP (2007)
  17. Pintér, János D.: Nonlinear optimization with GAMS /LGO (2007)
  18. Ali, M. Montaz; Khompatraporn, Charoenchai; Zabinsky, Zelda B.: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems (2005)
  19. Neumaier, Arnold; Shcherbina, Oleg; Huyer, Waltraud; Vinkó, Tamás: A comparison of complete global optimization solvers (2005)
  20. Shcherbina, Oleg; Neumaier, Arnold; Sam-Haroud, Djamila; Vu, Xuan-Ha; Nguyen, Tuan-Viet: Benchmarking global optimization and constraint satisfaction codes (2003)


Further publications can be found at: http://www.gamsworld.org/global/biblio.htm