New One‐Dimensional Search Iteration Algorithm and Engineering Application

Authors:
Open Access
Publisher website
Google Scholar
Abstract
In structural optimization design, obtaining the optimal solution of the objective function is the key to optimal design, and one‐dimensional search is one of the important methods for function optimization. The Golden Section method is the main method of one‐dimensional search, which has better convergence and stability. Based on the solution of the Golden Section method, this paper proposes an efficient one‐dimensional search algorithm, which has the advantages of fast convergence and good stability. An objective function calculation formula is introduced to compare and analyse this method with the Golden Section method, Newton method, and Fibonacci method. It is concluded that when the accuracy is set to 0.1, the new algorithm needs 3 iterations to obtain the target value. The Golden Section method takes 11 iterations, and the Fibonacci method requires 11 iterations. The Newton method cannot obtain the target value. When the accuracy is set to 0.01, the number of iterations of the new method is still the least. The optimized design of the T‐section beam is introduced for engineering application research. When the accuracy is set to 0.1, the new method needs 3 iterations to obtain the target value and the Golden Section method requires 13 iterations. When the accuracy is set to 0.01, the new method requires 4 iterations and the Golden Section method requires 18 iterations. The new method has significant advantages in the one‐dimensional search optimization problem.
Funding Information
  • National Natural Science Foundation of China (51808445)

This publication has 13 references indexed in Scilit: