fast-cma-es
scikit-opt
fast-cma-es | scikit-opt | |
---|---|---|
12 | 1 | |
106 | 4,991 | |
- | - | |
7.2 | 3.3 | |
6 months ago | 26 days ago | |
Python | Python | |
MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
fast-cma-es
-
Optimization problem with complex constrain
essentially the accumulated value of the portfolio after 50 years not clear to me how this can be linear - looks quite "exponential" without knowing the details. Can you exploit the "has to be greater than 0" condition to simplify the constraint into a linear one? "because at each time step there will be a decision" probably means the answer is "no". But don't overestimate the complexity of nonlinear optimizaiton (see for instance https://github.com/dietmarwo/fast-cma-es/blob/master/tutorials/CryptoTrading.adoc ), most of the complexity is hidden in the algorithm itself not visible for the user.
-
what methods can be used to solve a TP-BVP with variable control?
What about combining a fast numerical integrator like https://github.com/esa/torchquad or https://github.com/AnyarInc/Ascent with a fast parallel CMA-ES implementation like https://github.com/dietmarwo/fast-cma-es/blob/master/fcmaes/cmaescpp.py ? A numerical integrator allows you to implement variable control and a fast non-derivative optimizer can solve any related optimization problem.
-
Quality Diversity Optimization for Expensive Simulations
A new tutorial how to apply QD-optimization to expensive simulations: https://github.com/dietmarwo/fast-cma-es/blob/master/tutorials/Diversity.adoc .
-
New Fast Python CVT MAP-Elites + CMA-ES implementation
There is a new implementation of Python CVT MAP-Elites + CMA-ES available. It is presented at https://github.com/dietmarwo/fast-cma-es/blob/master/tutorials/MapElites.adoc applying it to ESAs very hard Cassini2 space mission planning optimization benchmark.
-
Performance of Evolutionary Algorithms for Machine Learning
I tried to answer these questions in EvoJax.adoc
-
Optimization for Quantum Computer Simulations
Here https://github.com/dietmarwo/fast-cma-es/blob/master/tutorials/Quant.adoc is a new tutorial how to apply optimization in the context of simulated quantum algorithms. It is based on https://qiskit.org/textbook/ch-applications/vqe-molecules.html#Example-with-a-Single-Qubit-Variational-Form but provides more reliable methods utilizing parallelism. This makes not much sense (yet) when the backend is a real quantum computer, but most simulators scale bad when using multi-threading or an GPU. So it is better to switch parallelism off for the simulation and utilize the better scaling parallel optmization provides, specially if a modern many-core CPU is available.
-
Transaction and Payment Optimization Problem
https://github.com/dietmarwo/fast-cma-es/blob/master/examples/subset.py implements the problem using parallel continuous optimization collecting different optimal solutions. Not much faster than GLPK_MI, but utilizing modern many-core CPUs when you are looking for a list of alternative solutions. Increase the number of retrys when you want more solutions.
-
A new fast local search heuristic for a location problem
Do you mind if I apply the generic optimization approach shown here: https://github.com/dietmarwo/fast-cma-es/blob/master/tutorials/OneForAll.adoc to this problem to compare results? I see you collected a huge number of benchmark instances. Are there solutions proven to be optimal availabe for these?
- New generic method to solve MMKP and VRPTW
-
29 Python real world optimization tutorials
using Python you may get some inspiration here: https://github.com/dietmarwo/fast-cma-es/blob/master/tutorials/Tutorials.adoc
scikit-opt
What are some alternatives?
optiseek - An open source collection of single-objective optimization algorithms for multi-dimensional functions.
zoofs - zoofs is a python library for performing feature selection using a variety of nature-inspired wrapper algorithms. The algorithms range from swarm-intelligence to physics-based to Evolutionary. It's easy to use , flexible and powerful tool to reduce your feature size.
ExpensiveOptimBenchmark - Benchmarking Surrogate-based Optimisation Algorithms on Expensive Black-box Functions
pycma - Python implementation of CMA-ES
Multi-UAV-Task-Assignment-Benchmark - A Benchmark for Multi-UAV Task Allocation of an Extended Team Orienteering Problem
Taskflow - A General-purpose Parallel and Heterogeneous Task Programming System
geneal - A genetic algorithm implementation in python
LightGBM - A fast, distributed, high performance gradient boosting (GBT, GBDT, GBRT, GBM or MART) framework based on decision tree algorithms, used for ranking, classification and many other machine learning tasks.
noisyopt - Python library for optimizing noisy functions.
PSO-cont-sched - Made for a college project, this Java program attempts to demonstrate how PSO might be used to solve container scheduling problems.