.png){kind=icon}
Return
Optimization using a modified second-order approach with evolutionary enhancement
.png){kind=icon}
PRE
AI
DOI：10.1109/TIE.2008.927987.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An optimization algorithm is presented which effectively combines the desirable characteristics of both gradient descent and evolutionary computation into a single robust algorithm. The method uses a population-based gradient approximation which allows it to recognize surface behavior on both large and small scales. By adjusting the population radius between iterations, the algorithm is able to escape local minima by shifting its focus onto global trends rather than local behavior. The algorithm is compared experimentally with existing methods over a set of relevant test cases, and each method is ranked on the basis of both reliability and rate of convergence. For each case, the algorithm is shown to outperform other methods in terms of both measures of performance, truly making it the best of both worlds.
Keywords:
evolutionary algorithms
gradient descent
optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.8W
Citations:
9.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more