Decision tree for optimization software

Decision tree for optimization software: Problem & Software: software sorted by problem to be solved. Benchmarks: collection of testresults and performance tests, made by us or others. Testcases: example files ready to use with existing software, in different formats. Books & Tutorials. Tools: software which helps formulating an optimization problem or simplifying its solution.

References in zbMATH (referenced in 42 articles )

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

1 2 3 next

  1. Xue, Dingyü; Chen, YangQuan: Scientific computing with MATLAB (2016)
  2. Dickinson, Peter J.C.; Povh, Janez: On an extension of Pólya’s Positivstellensatz (2015)
  3. Meszaros, Csaba: The practical behavior of the homogeneous self-dual formulations in interior point methods (2015)
  4. Berthold, Timo: RENS. The optimal rounding (2014)
  5. Bussieck, Michael R.; Dirkse, Steven P.; Vigerske, Stefan: PAVER 2.0: an open source environment for automated performance analysis of benchmarking data (2014)
  6. Chen, Fei; Xiang, Tao; Yang, Yuanyuan: Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud (2014)
  7. Farhood, Mazen; Beck, Carolyn L.: On the balanced truncation and coprime factors reduction of Markovian jump linear systems (2014)
  8. Berthold, Timo: Measuring the impact of primal heuristics (2013)
  9. Billups, Stephen C.; Larson, Jeffrey; Graf, Peter: Derivative-free optimization of expensive functions with computational error using weighted regression (2013)
  10. Mészáros, Csaba: On sparse matrix orderings in interior point methods (2013)
  11. Pintér, János D.; Kampas, Frank J.: Benchmarking nonlinear optimization software in technical computing environments (2013)
  12. Mittelmann, Hans D.: The state-of-the-art in conic optimization software (2012)
  13. Perez, Ruben E.; Jansen, Peter W.; Martins, Joaquim R.R.A.: PyOpt: a python-based object-oriented framework for nonlinear constrained optimization (2012)
  14. Mészáros, Csaba: Solving quadratically constrained convex optimization problems with an interior-point method (2011)
  15. Rothlauf, Franz: Design of modern heuristics. Principles and application. (2011)
  16. Sacchi, Luís Henrique; Armentano, Vinícius Amaral: A computational study of parametric tabu search for 0-1 mixed integer programs (2011)
  17. Wesselmann, Franz; Koberstein, Achim; Suhl, Uwe H.: Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (2011)
  18. Bayón, L.; Grau, J.M.; Ruiz, M.M.; Suárez, P.M.: An analytic solution for some separable convex quadratic programming problems with equality and inequality constraints (2010)
  19. D’Apuzzo, Marco; De Simone, Valentina; di Serafino, Daniela: On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods (2010)
  20. Mészáros, Csaba: The Bpmpd interior point solver for convex quadratically constrained quadratic programming problems (2010)

1 2 3 next