Jaya: Gradient-Free Optimization Algorithm for Single andMulti-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>.
Documentation:
Downloads:
Linking:
Please use the canonical formhttps://CRAN.R-project.org/package=Jayato link to this page.