References in zbMATH (referenced in 24 articles )

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

1 2 next

  1. Cao, Yankai; Zavala, Victor M.: A scalable global optimization algorithm for stochastic nonlinear programs (2019)
  2. Liu, Jianfeng; Ploskas, Nikolaos; Sahinidis, Nikolaos V.: Tuning BARON using derivative-free optimization algorithms (2019)
  3. Khajavirad, Aida; Sahinidis, Nikolaos V.: A hybrid LP/NLP paradigm for global optimization relaxations (2018)
  4. Zhao, Yingfeng; Zhao, Ting: Global optimization for generalized linear multiplicative programming using convex relaxation (2018)
  5. Puranik, Yash; Sahinidis, Nikolaos V.: Domain reduction techniques for global NLP and MINLP optimization (2017)
  6. Grimstad, Bjarne; Sandnes, Anders: Global optimization with spline constraints: a new branch-and-bound method based on B-splines (2016)
  7. Bussieck, Michael R.; Dirkse, Steven P.; Vigerske, Stefan: PAVER 2.0: an open source environment for automated performance analysis of benchmarking data (2014)
  8. Liberti, Leo; Ostrowski, James: Stabilizer-based symmetry breaking constraints for mathematical programs (2014)
  9. Zorn, Keith; Sahinidis, Nikolaos V.: Global optimization of general non-convex problems with intermediate bilinear substructures (2014)
  10. Ballerstein, Martin: Convex relaxations for mixed-integer nonlinear programs (2013)
  11. Pintér, János D.; Kampas, Frank J.: Benchmarking nonlinear optimization software in technical computing environments (2013)
  12. Chen, Jieqiu; Burer, Samuel: Globally solving nonconvex quadratic programming problems via completely positive programming (2012)
  13. Kim, Sunyoung; Kojima, Masakazu: Exploiting sparsity in SDP relaxation of polynomial optimization problems (2012)
  14. Liberti, Leo: Reformulations in mathematical programming: automatic symmetry detection and exploitation (2012)
  15. Nataraj, P. S. V.; Arounassalame, M.: Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (2011)
  16. Kleniati, Polyxeni-Margarita; Parpas, Panos; Rustem, Berç: Partitioning procedure for polynomial optimization (2010)
  17. Kim, Sunyoung; Kojima, Masakazu; Toint, Philippe: Recognizing underlying sparsity in optimization (2009)
  18. Smith, Andrew Paul: Fast construction of constant bound functions for sparse polynomials (2009)
  19. Kobayashi, Kazuhiro; Kim, Sunyoung; Kojima, Masakazu: Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (2008)
  20. Kobayashi, Kazuhiro; Nakata, Kazuhide; Kojima, Masakazu: A conversion of an SDP having free variables into the standard form SDP (2007)

1 2 next


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