The Up-Down Algorithm for Solving Global Optimization Problems

Li Zongyuan; Jiang Yanhui

doi:10.13374/j.issn1001-053x.1989.03.030

Volume 11 Issue 3

Nov. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 1989 > 11(3): 284-291

Li Zongyuan, Jiang Yanhui. The Up-Down Algorithm for Solving Global Optimization Problems[J]. Chinese Journal of Engineering, 1989, 11(3): 284-291. doi: 10.13374/j.issn1001-053x.1989.03.030

Citation:

Li Zongyuan, Jiang Yanhui. The Up-Down Algorithm for Solving Global Optimization Problems[J]. Chinese Journal of Engineering, 1989, 11(3): 284-291. doi: 10.13374/j.issn1001-053x.1989.03.030

Li Zongyuan, Jiang Yanhui. The Up-Down Algorithm for Solving Global Optimization Problems[J]. Chinese Journal of Engineering, 1989, 11(3): 284-291. doi: 10.13374/j.issn1001-053x.1989.03.030

Citation:

Li Zongyuan, Jiang Yanhui. The Up-Down Algorithm for Solving Global Optimization Problems[J]. Chinese Journal of Engineering, 1989, 11(3): 284-291. doi: 10.13374/j.issn1001-053x.1989.03.030

PDF( 571 KB)

The Up-Down Algorithm for Solving Global Optimization Problems

doi: 10.13374/j.issn1001-053x.1989.03.030

Received Date: 1988-07-22
Available Online: 2021-11-15

Abstract

Abstract

A new algorithm which is called the Up-down Algorithm, forsolving a global optimization problem is given. The algorilhm is more efficient for a class of engineering optimization problems that have a dimension n ≤ 5-6. The algorithm and its convergence, optimization condition, some suggestions about the computation, and the examples are given.
- global optimization,
- Up-Down algorithm,
- multiple numerical integration