MDS无线传感器网络定位算法MATLAB程序

构造围长8列重4的准循环的LDPC码的MATLAB源码

lbm方法模拟圆柱绕流，边界条件采用平衡外推格式，有明显的涡街

机器人避障的matlab仿真实现，有源码，有动画效果-Robot obstacle avoidance realize the matlab simulation, has source, has animation effects

图像的压缩感知之AMP算法，相较于FISTA算法在执行效率上更加有效，迭代到30次左右可实现很小的误差。

单纯形法matlab程序，运用matlab写出单纯形法基本程序，单纯形入门。

调用vlc的库，自己用MFC实现的一个vlc的播放器，可以输入rtsp的url就可以播放，代码结构清晰，逻辑简单，适合PC端的工具开发与移植

在CCS模拟下的DSP 54XX（5416）下的FIR滤波器支持高通，带通和低通。如果需要自己产生滤波系数和数据的话，请用matlab自己产生

alternating direction method of multipliers优化算法讲解OutlineDual decompositionMethod of multipliersAlternating direction method of multipliersCommon patternsExamplConsensus and exchangeConclusionsDual decompositionDual problemp convex equality constrained optimization problemminimizesubject to Ax= 6e Lagrangian: L(a, g)=f(a)+y(Ac-bdual function: g(y)=infx L(, g)e dual problem: maximize g(g)recover x*=argminL(, y*)Dual decompositionDual ascentgradient method for dual problem: y+l=yk +aVg(yky ")=A c-b, where a= argmin L(a, y")b dual ascent method isk+1gminz L(a, yk/-minimization(Axk+I-b)// dual updateworks, with lots of strong assumptionsDual decompositionDual decompositione suppose f is separablef(x)=f1(x1)+…+fN(xN),x=(x1Nthen L is separable in x: L(a, y)=L1(a1, 3)+...+Ln(N, 3)-y bLi(ai, y)=fi(ai)+y Aiaie -minimization in dual ascent splits into N separate minimizationsk+1argmin Li(li, y)Which can be carried out in parallelDual decompositionDual decompositiondual decomposition(Everett, Dantzig, Wolfe, Benders 1960-65k+1argLi(ei, y)N A: k+scatterupdate i in parallel, gather Ai k+solve a large problemby iteratively solving subproblems(in parallel)dual variable update provides coordinationworks, with lots of assumptions; often slowDual decompositionOutlineDual decompositionMethod of multipliersAlternating direction method of multipliersCommon patternsExamplConsensus and exchangeConclusionsMethod of multipliersMethod of multipliersa method to robustify dual ascentb use augmented Lagrangian(Hestenes, Powell 1969),p>0(, y)=f(c)+y(Ax-b)+(p/2)Acmethod of multipliers( Hestenes, Powell; analysis in Bertsekas 1982)k+1argmin Lp(a, yD(A.(note specific dual update step length pMethod of multipliersMethod of multipliers dual update stepoptimality conditions( for differentiableAcx-b=0, Vf(a*)+A(primal and dual feasibility)Since ah+1minimizes Lp(a, y)k+1 kf(x4+1)+A7(y+p(AVxf(at)+adual update yti=y+p(k+1k+1dual feasibleprimal feasibility achieved in limit: A k+I-b>0Method of multipliers

S7-1200 PLC 的例程目前该文档中的所有例程均由TIA 博途V14SP1编程,

基于稀疏表示的人脸识别系统设计采用sparse 中的L1-norm minimization基于经典入门论文《face recogniton via sparse representation》MATLAB程序，完全运行，包含基本GUI设计和完整代码可以参考说明一步步跑下来，希望能帮助大家