C#启动界面类似动画效果，非常漂亮，可以设置等待时间

自己做的粒子群算法解决VRP毕业论文用matlab编写的

包含全国第六次人口普查数据，精度达乡镇级别

局部保持投影 （Locality Preserving Projections ）原文及其matlab代码，研究机器学习和模式识别的应该很多人想要。

这是模板匹配sad方法的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

最小二乘支持向量机matlab源代码，内有详细使用教程，非常易学，使用也很快，结果精度也较高，毕业论文就全靠它

本资源包含求图片中最小矩形的函数（minboundrect.m）本函数已经流传多年，非常经典。还包括一个测试程序以及测试图片！本人已经测试过了，可以运行，希望对您有用！

博文 CanFestival移植至战舰STM32F1开发板链接 https://blog.csdn.net/yy123xiang/article/details/80680790

量子图像加密算法仿真实现，包含经典图像仿真与量子图像仿真实现代码

基于pca实现人脸识别，是经典的人脸识别算法之一，有较好的识别效果