PSO Application

A matlab function for steepest descent optimization using Quasi Newton's method : BGFS & DFP

Visit: https://aliasgharheidari.com/HGS.html. HGS optimizer is a population-based method with stochastic switching elements that enrich its main exploratory and exploitative behaviors and flexibility of HGS in dealing with challenging problem landscapes. The algorithm has been compared to LSHADE, SPS_L_SHADE_EIG, LSHADE_cnEpSi, SHADE, SADE, MPED…

The optimization field suffers from the metaphor-based “pseudo-novel” or “fancy” optimizers. Most of these cliché methods mimic animals' searching trends and possess a small contribution to the optimization process itself. Most of these cliché methods suffer from the locally efficient performance, biased verification methods on easy problems, an…

University of Pisa Optimization Methods and Game Theory

A modified version of the historical MATLAB code MELT additionally enabling tail-fitting on lifetime spectra consisting of distributed characteristic lifetimes using Maximum Entropy for optimization

A research and project of a interplanetary transfer targetting Mars from Earth made with patched conics technique and optimized with PSO algorithym implemented for Matlab

Rešenja zadataka sa računarskih vežbi iz predmeta "Metode optimizacije"

The main purpose of the project is to analyze the optimization methods currently employed to perform the training of the support vector machines (SVM).

FBGA-MLP model (hybrid machine learning model)

Solver for minimization problems over the l1-ball

Computational methods for beam angle optimization in intensity modulated radiotherapy

This project focus on studying diffrient optimization techniques for designing magnetic coupler. applied GA , SA , PSO, and Horas algorithms

rosenbrock function optimization with four different methods (unconstrained optimization)

CEopt is a Matlab routine for nonconvex optimization using the Cross-Entropy method and augmented Lagrangian formulation.

Single Cheese Cutting Space Mapping Optimization

Blockwise Direct Search

the knapsack problem and the subset sum problem (NP-Hard Problem)