We show that the herding procedure of Welling (2009b) takes exactly the form of a standard convex optimization algorithm— namely a conditional gradient algorithm minimizing a quadratic moment discrepancy. This link enables us to invoke convergence results from convex optimization and to consider faster alternatives for the task of approximating integrals in a reproducing kernel Hilbert space. W...

The Search and Rescue optimization algorithm (SAR) is a recent metaheuristic inspired by the exploration’s behaviour for humans throughout search rescue processes. SAR applied to solve Combined Emission Economic Dispatch (CEED) Load (ELD). comparative performance of against several methods was performed assess its reliability. These algorithms include Earthworm (EWA), Grey wolf optimizer (GWO),...

Metaheuristics is one of the most well-known field researches uses to find optimum solution for Non-deterministic polynomial hard problems (NP-Hard), that are difficult an optimal in a time. Over time many algorithms have been developed based on heuristics solve real-life problems, this paper will introduce Metaheuristic-based and its classifications, problems. It also compare performance two m...

Abstract The elephant herding optimization (EHO) algorithm is a novel metaheuristic optimizer inspired by the clan renewal and separation behaviors of populations. Although it has few parameters easy to implement, suffers from lack exploitation, leading slow convergence. This paper proposes an improved EHO called manta ray foraging Gaussian mutation-based for global (MGEHO). updating operator i...