Conformational space annealing explained: a general optimization algorithm, with diverse applications
From MaRDI portal
Publication:6097845
Recommendations
- An adaptive simulated annealing algorithm for global optimization over continuous variables
- scientific article; zbMATH DE number 906530
- scientific article; zbMATH DE number 1487985
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization
Cites work
- A Limited Memory Algorithm for Bound Constrained Optimization
- A literature survey of benchmark functions for global optimisation problems
- A Simplex Method for Function Minimization
- Algorithm 778: L-BFGS-B
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- scientific article; zbMATH DE number 1131224 (Why is no real title available?)
- Newton-Type Minimization via the Lanczos Method
- Remark on ``Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization
This page was built for publication: Conformational space annealing explained: a general optimization algorithm, with diverse applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097845)