image thumbnail

updated 3 months ago

minimization of a function by random iterative search by yoash levron

Optimization method: Locates a minimum of a target function. Converges to global optimum. (optimization, minimization, optimal)

b =min_by_random_search_test_func(v)

b =min_by_random_search_test_func2(v)

min_by_random_search( fnc, region )

image thumbnail

updated 12 months ago

Numerically Design Power Complementary IIR(FIR) Filter by Shamail

One iir filter is given, design power (or magnitude) complementary filter numerically (filter, iir fir, power)

costFunctionIIR(coeff1, coeff2, freqPoints)

mainIIR.m

image thumbnail

updated 1 year ago

fminsearchbnd, fminsearchcon by John D'Errico

Bound constrained optimization using fminsearch (bound constrained, fminsearch, constraint)

fminsearchbnd_demo

fminsearchcon_demo

[x,fval,exitflag,output]=fminsearchcon(fun,x0,LB,UB,A,b,non...

image thumbnail

updated almost 2 years ago

Optimization Tips and Tricks by John D'Errico

Tips and tricks for use of the optimization toolbox, linear and nonlinear regression. (confidence intervals, examples, tutorial)

optimtips

[x,fval,exitflag,output]=fminsearchbnd(fun,x0,LB,UB,options...

consolidator(x,y,aggregation_mode,tol)

image thumbnail

updated 2 years ago

Simple example of the Simplex Method by Andrea Cirillo

It's a function that finds the minimum value of a two variables function with the simplex method. (function, method, mathematics)

simplexMethod(fun, init_point, step_size, toll, numMaxIter)

image thumbnail

updated 2 years ago

Fibonacci Search method by Shakun Bansal

this function finds the interval in which minima of function lies,using the Fibonacci series. (mathematics, optimization, minimization)

unimodal.m

fibonaccisearch.m

image thumbnail

updated 4 years ago

DFP quasi Newton method by Bapi Chatterjee

It solves an optimization problem by DFP quasi Newton method. (quasi newton, convex, unconstrained)

quasi_newton_dfp.m

image thumbnail

updated 4 years ago

Steepest descent method by Bapi Chatterjee

It solves an optimization problem by steepest descent method. (steepest descent, convex, minimization)

steepestdescent.m

image thumbnail

updated 13 years ago

fminconset by Ingar Solberg

Solves constrained minimization problems, some of the variables are restricted to discrete values (optimization, discrete values, problems)

[c,ceq,gc,gceq,hc,hceq]=h134org(x,varargin)

fminconset(fun,x0,A,b,Aeq,beq,lb,ub,nonlcon,options,set,Jmi...

j134org(x,varargin)

Contact us