It's a function that finds the minimum value of a two variables objective function with a deterministic zero order algorithm: simplex method.
The input variables are: -fun: inline function of the objective function -init_point: initial point for the simplex method -step_size: initial dimension of the simplex toll: tolerance for the stop criterion on the simplex dimension -numMaxIter: stop criterion on...
We use the power of symbolic toolbox in order to find the optimal point in an arbitrary multivariate function Change the following code based on your objective function and run the program
Function F in Symbolic Format
CONDOR is a new optimizer whose aim is to find the minimum x* of an objective function F(x) (x is a vector whose dimension is between 1 and 150) using the least number of function evaluations of F(x). It is assumed that the dominant computing cost...
This script may be easily converted to a function which could be an extremely useful subroutine in optimization problems to check whether the objective function is globally convex. It may also be used to derive the expressions for gradient and...
This is a version of Wesam Elshamy's PSO code that can be put to general use on any objective function. All parameters and hyper-parameters can be set at the command line by the user.
Functions that take matrix arguments (i.e. can...
A recursive algorithm that queries an objective function to guess an unknown integer. An integer guessing 'game' for a function `isleq', that returns true for all values less than or equal to a mystery number.
It's a deterministic iterative zero order algorithm that can be used to solve unconstrained optimization problem. It finds the relative minimum of a two variables function with a deterministic iterative zero order algorithm.
Pattern...
In order to optimize any MATLAB function, there are two options: 1) rewrite the function to take only 1 array of inputs, reading all others from a file, perhaps, or from a global variable (undesirable), or 2) write an interface layer that handles...
Broydon - Fletcher - Goldfarb - Shanno (BFGS) Method
this contains following files: objective function.m BFGS.m and other 2 files.
Non-visual Delphi component for scientific calculation. It implements several methods of local minimization. The objective function can be specified in symbolical form. Methods implemented: Rosenbrock method Quasi-Newton algorithms...
This contribution provides functions for finding an optimum parameter set using the evolutionary algorithm of Differential Evolution. Simply speaking: If you have some complicated function of which you are unable to compute a derivative, and you...
A wrap of lsqnonlin to calculate Jacobian using symbolic math toolbox. This is one of applications of symbolic math toolbox for optimization. Due to limitations of the symbolic math toolbox, the objective function must be supported by the symbolic...
See paper "Minimum settling time control design through direct search methods" (preprint on http://arxiv.org/abs/1109.5966) by the same author.
The settling time of a closed-loop response, depending on controller parameters,...
NSGA-II is a very famous multi-objective optimization algorithm. I submitted an example previously and wanted to make this submission useful to others by creating it as a function. Even though this function is very specific to benchmark problems,...
It finds the minimum of a n variables function with the Particle Swarm Optimization Algorithm.
% The input parameters are: % -func: it's the objective function's handle to minimize % -numInd: it's the number of the swarm's...
MANY takes in the variable x and assign it to all the output variables. MANY takes in the variable x and assign it to all the output variables.
This function works as the equation sign in C++ so that the following expression in...
Nonlinear optimization problems with bound constraints can be solved using FMINSEARCHBND (as well as using many other tools.) For the user who has a problem with linear inequality constraints and/or general nonlinear inequalities as well as bound...
We propose a new global optimization algorithm based on a harmony search scheme, termed as harmony element string algorithm (abbreviated as HEA). The algorithm has five fundamental features: (1) The states of the system is represented by strings...
This is an extremely elementary function that tells you the total memory currently allocated in MB.
It accepts the whos command as an input argument. Which allows the code to see the total memory usage from outside of it's scope (being...
This contribution is made in order to calculate the maximum likelihood contour plots of any function. Just replace the <<fcnObjfun>> file with your function change some basic settings in the <<Example>> file and there you... |