An efficient method for determining all the extreme points of function with one variable
An algorithm for determining all the extreme and inflection points to one variable multi-modal global optimization problems is presented. The algorithm is directly suitable for a class of problems of commonly used in solving the global optimization problems. The algorithm is the combination of the f...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 主題: | |
| 在線閱讀: | http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/3049/1/QA%209.58%20.P3%202013%20Abstract.pdf http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/3049/2/QA%209.58%20.P3%202013%20FullText.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | An algorithm for determining all the extreme and inflection points to one variable multi-modal global optimization problems is presented. The algorithm is directly suitable for a class of problems of commonly used in solving the global optimization problems. The algorithm is the combination of the filled function's algorithm and Inner Iteration algorithm, called IRH's algorithm, in which Inner Iteration algorithm works at the domain which is usually ignored by filled function's algorithm. |
|---|