- Category:
- matlab
- Tags:
-
- File Size:
- 3kb
- Update:
- 2018-01-29
- Downloads:
- 0 Times
- Uploaded by:
- hxxa
Description: The gradient descent method is the earliest and most simple and most commonly used optimization method. The gradient descent method is simple to realize. When the objective function is a convex function, the solution of the gradient descent method is a global solution. In general, the solution is not guaranteed to be the global optimal solution, and the gradient descent method is not necessarily the fastest. The optimization idea of gradient descent method is to use the current position negative gradient direction as the search direction, because the direction is the fastest descending direction of the current position, so it is also called the steepest descent method. The faster the slowest descent approach is closer to the target, the smaller the step, the slower the progress.
To Search:
File list (Check if you may need any files):
Filename | Size | Date |
---|
PSO.m | 1117 | 2018-01-29
|
Untitled9.m | 40 | 2018-01-29
|
psoo 30.m | 45 | 2018-01-29
|
Untitled5.m | 14 | 2018-01-28
|
Untitled21.m | 94 | 2018-01-29
|
Untitled2.m | 67 | 2018-01-19
|
Untitled.m | 48 | 2018-01-28
|
Untitled3.m | 17 | 2018-01-19
|
Untitled10.m | 48 | 2018-01-28
|
Untitled2222.m | 65 | 2018-01-28
|
fsht.m | 143 | 2018-01-19
|
kkk.m | 64 | 2018-01-28
|
psooo.m | 1854 | 2018-01-28 |