技术并不是我们的全部

DirectoryCoordinate Descent MethodBlock Coordinate Descent MethodCoordinate Descent MethodConditions Required: The objective function is differentiable and smooth.The coodinate descent method is not a gradient optimal method. The method can find the..

Directory1. Descent Methods2. Gradient Descent MethodInterpretation of GDMDifferential（1） the differential of one variable（2）the differential of variables（3）Gradient3. Batch gradient descent Method4. Stochastic gradient descent Method5. Mini-Batch Gradie..

一、 Optimization ProblemThe normal optimization problem ismin⁡xf(x)\min_{x} f(x)xmin​f(x)where the xxx is optimization variance. By optimizing xxx, the function f(x)f(x)f(x) can be minimized.Actually, xxx need to be constrained by equations or inequatio

1、原著 2、翻译

常用的排序算法总结插入排序时间复杂度：O(n^2)实现思路：（1） 设置基准数a[0]，将待插入纪录的值赋值给a[0]；（2） 设置开始查找的位置moveInd；（3） 在数组中进行搜索，搜索中将第moveInd个纪录后移，直至a[0].value≥a[moveInd].value为止；（4） 将a[0]插入a[moveInd+1]的位置上。/****************************