Benchmarks for Optimization Software

Benchmarks for Optimization Software: Here we provide information on testruns comparing different solution methods on standardized sets of testproblems, running on the same or on different computer systems. Benchmarking is a difficult area for nonlinear problems, since different codes use different criteria for termination. Although much effort has been invested in making results comparable, in a critical situation you should try the candidates of your choice on your specific application. Many benchmark results can be found in the literature, ..

References in zbMATH (referenced in 103 articles )

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

1 2 3 4 5 6 next

  1. Klep, Igor; Povh, Janez: Constrained trace-optimization of polynomials in freely noncommuting variables (2016)
  2. O’Donoghue, Brendan; Chu, Eric; Parikh, Neal; Boyd, Stephen: Conic optimization via operator splitting and homogeneous self-dual embedding (2016)
  3. Santos, Haroldo G.; Toffolo, Túlio A.M.; Gomes, Rafael A.M.; Ribas, Sabir: Integer programming techniques for the nurse rostering problem (2016)
  4. Lubin, Miles; Dunning, Iain: Computing in operations research using Julia (2015)
  5. Mamalis, Basilis; Pantziou, Grammati: Advances in the parallelization of the simplex method (2015)
  6. Berthold, Timo: RENS. The optimal rounding (2014)
  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. Rui, Shaoping; Xu, Chengxian: An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function (2014)
  9. Tatsumi, Keiji; Tanino, Tetsuzo: Support vector machines maximizing geometric margins for multi-class classification (2014)
  10. Berthold, Timo: Measuring the impact of primal heuristics (2013)
  11. Burgdorf, Sabine; Cafuta, Kristijan; Klep, Igor; Povh, Janez: The tracial moment problem and trace-optimization of polynomials (2013)
  12. Burgdorf, Sabine; Cafuta, Kristijan; Klep, Igor; Povh, Janez: Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials (2013)
  13. Chvátal, Vašek; Cook, William; Espinoza, Daniel: Local cuts for mixed-integer programming (2013)
  14. Cook, William; Koch, Thorsten; Steffy, Daniel E.; Wolter, Kati: A hybrid branch-and-bound approach for exact rational mixed-integer programming (2013)
  15. Mizutani, Tomohiko; Yamashita, Makoto: Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (2013)
  16. Smith, Laurence; Chinneck, John; Aitken, Victor: Improved constraint consensus methods for seeking feasibility in nonlinear programs (2013)
  17. Waki, Hayato; Muramatsu, Masakazu: Facial reduction algorithms for conic optimization problems (2013)
  18. Yang, Li; Yu, Bo: A homotopy method for nonlinear semidefinite programming (2013)
  19. Bixby, Robert E.: A brief history of linear and mixed-integer programming computation (2012)
  20. Doan, Xuan Vinh; Kruk, Serge; Wolkowicz, Henry: A robust algorithm for semidefinite programming (2012)

1 2 3 4 5 6 next

Further publications can be found at: