The CC-GDG-CMAES algorithm
An effective algorithm to solve large scale unconstrained black box optimization problems
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
This algorithm solves large scale unconstrained black box optimization problems by divide-and-conquer strategy. It decomposes the large set of decision variables into smaller subcomponents using the Global Differential Grouping (GDG) and then optimize each subcomponents by the CMS-ES optimizer.
Cite As
Yi Mei (2026). The CC-GDG-CMAES algorithm (https://www.mathworks.com/matlabcentral/fileexchange/45783-the-cc-gdg-cmaes-algorithm), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.0.0 (7.17 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
