-
Notifications
You must be signed in to change notification settings - Fork 42
/
Copy pathlmm.m
29 lines (29 loc) · 855 Bytes
/
lmm.m
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
function [x,val,k]=lmm(Fk,JFk,x0)
%功能: 用L-M方法求解非线性方程组: F(x)=0
%输入: x0是初始点, Fk, JFk 分别是求F(xk)及F’(xk)的函数.
%输出: x, val分别是近似解及——F(xk)——的值, k是迭代次数.
maxk=100; %给出最大迭代次数
rho=0.55;sigma=0.4; muk=norm(feval(Fk,x0));
k=0; epsilon=1e-6; n=length(x0);
while(k<maxk)
fk=feval(Fk,x0); %计算函数值
jfk=feval(JFk,x0); %计算Jacobi阵
gk=jfk'*fk;
dk=-(jfk'*jfk+muk*eye(n))\gk; %解方程组Gk*dk=-gk, 计算搜索方向
if(norm(gk)<epsilon), break; end %检验终止准则
m=0; mk=0;
while(m<20) % 用Armijo搜索求步长
newf=0.5*norm(feval(Fk,x0+rho^m*dk))^2;
oldf=0.5*norm(feval(Fk,x0))^2;
if(newf<oldf+sigma*rho^m*gk;*dk)
mk=m;
break;
end
m=m+1;
end
x0=x0+rho^mk*dk;
muk=norm(feval(Fk,x0));
k=k+1;
end
x=x0;
val=0.5*muk^2;