Ascent
A fast and flexible C++ simulation engine and differential equation solver. (by AnyarInc)
fast-cma-es
A Python 3 gradient-free optimization library (by dietmarwo)
Ascent | fast-cma-es | |
---|---|---|
1 | 12 | |
114 | 103 | |
2.6% | - | |
0.0 | 7.2 | |
over 1 year ago | 6 months ago | |
C++ | Python | |
Apache License 2.0 | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
Ascent
Posts with mentions or reviews of Ascent.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-02-17.
-
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.
fast-cma-es
Posts with mentions or reviews of fast-cma-es.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-02-17.
-
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
What are some alternatives?
When comparing Ascent and fast-cma-es you can also consider the following projects:
uwv-simulator - A underwater vehicle simulation test-bed with SAUVC swimming pool environment with 6-vectored thruster configuration vehicle operating in remote controlled and autonomous mode.
optiseek - An open source collection of single-objective optimization algorithms for multi-dimensional functions.
FreeFem-sources - FreeFEM source code
scikit-opt - Genetic Algorithm, Particle Swarm Optimization, Simulated Annealing, Ant Colony Optimization Algorithm,Immune Algorithm, Artificial Fish Swarm Algorithm, Differential Evolution and TSP(Traveling salesman)