Jaya
Gradient-Free Optimization Algorithm for Single and Multi-Objective Problems
An implementation of the Jaya optimization algorithm for both single-objective and multi-objective problems. Jaya is a population-based, gradient-free optimization algorithm capable of solving constrained and unconstrained optimization problems without hyperparameters. This package includes features such as multi-objective Pareto optimization, adaptive population adjustment, and early stopping. For further details, see R.V. Rao (2016) <doi:10.5267/j.ijiec.2015.8.004>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0.3 |
rolling linux/jammy R-4.5 | Jaya_1.0.3.tar.gz |
63.8 KiB |
1.0.3 |
rolling linux/noble R-4.5 | Jaya_1.0.3.tar.gz |
63.8 KiB |
1.0.3 |
rolling source/ R- | Jaya_1.0.3.tar.gz |
30.4 KiB |
1.0.3 |
latest linux/jammy R-4.5 | Jaya_1.0.3.tar.gz |
63.8 KiB |
1.0.3 |
latest linux/noble R-4.5 | Jaya_1.0.3.tar.gz |
63.8 KiB |
1.0.3 |
latest source/ R- | Jaya_1.0.3.tar.gz |
30.4 KiB |
1.0.3 |
2026-04-26 source/ R- | Jaya_1.0.3.tar.gz |
30.4 KiB |
1.0.3 |
2026-04-23 source/ R- | Jaya_1.0.3.tar.gz |
30.4 KiB |
1.0.3 |
2026-04-09 windows/windows R-4.5 | Jaya_1.0.3.zip |
65.3 KiB |
1.0.3 |
2025-04-20 source/ R- | Jaya_1.0.3.tar.gz |
30.4 KiB |