Awesome GitHub RepositoriesGlobal Optimization Frameworks

This is a Python scientific computing library for finding the global maximum of expensive black-box functions. It operates as a global optimization framework that identifies optimal input parameters within defined bounds to maximize a target output. The library utilizes Gaussian process regression to predict function values and uncertainty, guiding the search for optimal parameters. It employs a surrogate-model optimization approach to approximate high-cost objective functions, reducing the total number of required evaluations. The system manages the trade-off between exploration and exploit

This is a Bayesian optimization library for Python designed to find the maximum value of expensive black box functions. It operates as a global optimizer that uses probabilistic models to identify the peak value of unknown functions through iterative sampling. The tool is specifically designed for hyperparameter tuning in machine learning, where it maximizes model performance while minimizing the number of required training runs. It treats the target function as a black box, selecting optimal input parameters based on statistical priors to reduce manual trial and error. The system utilizes G

scikit-opt is a Python optimization library and numerical framework designed to solve complex global optimization problems. It provides a suite of metaheuristic algorithms and tools for finding global minima or maxima of objective functions. The library implements a variety of nature-inspired and swarm intelligence algorithms, including Genetic Algorithms, Particle Swarm Optimization, Differential Evolution, Simulated Annealing, and Ant Colony Optimization. It includes specialized solvers for discrete combinatorial challenges, such as the Traveling Salesman Problem. The framework supports th

Optim.jl is a numerical optimization library for the Julia programming language, providing a comprehensive framework for minimizing or maximizing univariate and multivariate functions. It offers a suite of tools for solving both constrained and unconstrained mathematical problems, utilizing a variety of gradient-based, derivative-free, and stochastic search methods. The library distinguishes itself through a modular architecture that leverages language-level multiple dispatch to automatically select efficient solvers based on input data types and objective function properties. It supports com