LinearRegression | general linear regression |
adsmax | ADSMAX Alternating directions method for direct search optimization. |
battery | Copyright (C) 2004 Michael Creel |
bfgsmin | % bfgsmin: bfgs or limited memory bfgs minimization of function |
bfgsmin_example | Copyright (C) 2004,2005,2006 Michael Creel |
brent_line_min | % Line minimization of f along df |
cdiff | % c = cdiff (func,wrt,N,dfunc,stack,dx) - Code for num. differentiation |
cg_min | % NonLinear Conjugate Gradient method to minimize function @var{f}. |
cg_min_example_1 | % ok = test_conjgrad_min - Test that conjgrad_min works |
cg_min_example_2 | % |
cg_min_example_3 | % ok = test_conjgrad_min - Test that conjgrad_min works with extra |
d2_min | % [x,v,nev,h,args] = d2_min(f,d2f,args,ctl,code) - Newton-like minimization |
deriv | % deriv(f,x0[,h,O,N]) |
dfdp | Copyright (C) 1992-1994 Richard Shrager |
expdemo | % An example of expfit in action |
expfit | % USAGE [alpha,c,rms] = expfit( deg, x1, h, y ) |
fmin | |
fminbnd | % |
fmins | % |
fminsearch | % |
fminunc | % [x,v,flag,out,df,d2f] = fminunc (f,x,opt,...) - M*tlab-like optimization |
fzero | % |
leasqr | Copyright (C) 1992-1994 Richard Shrager |
leasqrdemo | Copyright (C) 1992-1994 Richard Shrager |
line_min | % [a,fx,nev] = line_min (f, dx, args, narg) - Minimize f along dx |
linprog | % Solve a linear program. @code{linprog} solves the following LP: |
mdsmax | MDSMAX Multidirectional search method for direct search optimization. |
minimize | % [x,v,nev,...] = minimize (f,args,...) - Minimize f |
nelder_mead_min | % [x0,v,nev] = nelder_mead_min (f,args,ctl) - Nelder-Mead minimization |
nmsmax | NMSMAX Nelder-Mead simplex method for direct search optimization. |
nrm | % Using @var{x0} as a starting point find a minimum of the scalar |
optimset | % opt = optimset (...) - manipulate m*tlab-style options structure |
poly_2_ex | % ex = poly_2_ex (l, f) - Extremum of a 1-var deg-2 polynomial |
polyconf | % [y,dy] = polyconf(p,x,s) |
rosenbrock | Copyright (C) 2004 Michael Creel |
samin_example | Copyright (C) 2004 Michael Creel |
test_d2_min_1 | % Test whether d2_min functions correctly |
test_d2_min_2 | % Test whether d2_min functions correctly, with two args |
test_d2_min_3 | % Test whether d2_min functions correctly |
test_fminunc_1 | % test_fminunc_1 - Test that fminunc and optimset work |
test_min_1 | % |
test_min_2 | % test_min_2 - Test that bfgs works |
test_min_3 | % ok - Test that bfgs works with extra |
test_min_4 | % test_bfgs - Test that bfgs works |
test_minimize_1 | % ok = test_minimize - Test that minimize works |
test_nelder_mead_min_1 | % |
test_nelder_mead_min_2 | % |
test_wpolyfit | % Tests for wpolyfit. |
wpolyfit | % Return the coefficients of a polynomial @var{p}(@var{x}) of degree |
wpolyfitdemo | % wpolyfitdemo(p) |
wsolve | % [x,s] = wsolve(A,y,dy) |