Conformational space annealing explained: a general optimization algorithm, with diverse applications

DOI10.1016/j.cpc.2017.09.028zbMath1527.90265OpenAlexW2766238987MaRDI QIDQ6097845

Steven P. Gross, Jooyoung Lee, Jong Yun Kim, InSuk Joung, Keehyoung Joo

Publication date: 7 June 2023

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cpc.2017.09.028

zbMATH Keywords

global optimizationcombinatorial optimizationgenetic algorithmparameter optimization problemconformational space annealing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A literature survey of benchmark functions for global optimisation problems
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization”
• Newton-Type Minimization via the Lanczos Method
• Algorithm 778: L-BFGS-B
• A Limited Memory Algorithm for Bound Constrained Optimization
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• A Simplex Method for Function Minimization

This page was built for publication: Conformational space annealing explained: a general optimization algorithm, with diverse applications