Search - 1970 - CodeBus

Search - 1970 - List

[matlab] ACATSP DL : 0: 蚁群算法的MATLAB程序，提供变量初始化 C=[1304 2312 3639 1315 4177 2244 3712 1399 3488 1535 3326 1556 3238 1229 4196 1004 4312 790 4386 570 3007 1970 2562 1756 2788 1491 2381 1676 1332 695 3715 1678 3918 2179 4061 2370 3780 2212 3676 2578 4029 2838 4263 2931 3429 1908 3507 2367 3394 2643 3439 3201 2935 3240 3140 3550 2545 2357 2778 2826 2370 2975] m=31 Alpha=1 Beta=5 Rho=0.9 Q=100 NC_max=200 -Ant colony algorithm of MATLAB procedures, initialize the variable C = [1304 2312 3639 1315 4177 2244 3712 1399 3488 1535 3326 1556 3238 1229 4196 1004 4312 790 4386 570 3007 1970 2562 1756 2788 1491 2381 1676 1332 695 3715 1678 3918 2179 4061 2370 3780 2212 3676 2578 4029 2838 4263 2931 3429 1908 3507 2367 3394 2643 3439 3201 2935 3240 3140 3550 2545 2357 2778 2826 2370 2975] m = 31 Alpha = 1 Beta = 5 Rho = 0.9 Q = 100 NC_max = 200
Date : 2025-12-27 Size : 2kb User : xiaofei
[matlab] (BFGS 算法程序) DL : 0: BFGS 校正是目前最流行也是最有效的拟牛顿校正, 它是由 Broyden, Fletcher, Goldfarb 和 Shanno 在 1970 年各自独立提出的拟牛顿法, 故称为 BFGS 算法.(BFGS correction is the most popular and effective quasi Newton correction at present. It is composed of Broyden, Fletcher, Goldfarb and Shanno respectively proposed the quasi Newton method in 1970, so it is called BFGS Algorithm)
Date : 2025-12-27 Size : 6kb User : 梦梦111
[matlab] bfgs DL : 0: BFGS算法(BFGS algorithm)，是一种逆秩2拟牛顿法。Hk+，满足拟牛顿方程的逆形式Hk+}少一、k=s.当Hk正定且(，'，少)}0时Hkh，也正定，因此，由BFGS修正确定的算法xk+} - xk - HkF Cxk)是具有正定性、传递性的拟牛顿法，它也是无约束优化中最常用的、最稳定的算法之一这种算法是布罗依丹(Broy-den,C. G.)于1969年，以及弗莱彻(Fletcher , R. ) ,戈德福布(Goldforb,D. )、香诺(Shan no, D. F.)于1970年分别得到的，故称为BFGS算法.(The BFGS algorithm is an inverse rank 2 quasi-Newton method.Hk +, to satisfy the inverse form of the quasi-Newton equation Hk +} less one, k = s. When Hk is definite and (, ', less)} 0 Hkh, is also positive definite, therefore, the algorithm determined by the BFGS correction xk +} - xk - HkF Cxk) is a quasi-Newton method with positive definiteness and transitivity. It is also one of the most commonly used and most stable algorithms in unconstrained optimization. This algorithm was Broy-den (CG) in 1969, and Fletcher (R.), Goldforb (D.), and Shanno (DF) were obtained in 1970 respectively, hence the BFGS algorithm.)
Date : 2025-12-27 Size : 1kb User : ranin