New One-Dimensional Search Iteration Algorithm and Engineering Application

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 con...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Yiping Luo, Jinhao Meng, Defa Wang, Guobin Xue
Formato:	article
Lenguaje:	EN
Publicado:	Hindawi Limited 2021
Materias:	Physics QC1-999
Acceso en línea:	https://doaj.org/article/bed127f6071342aabdc8dc1e38cb3363
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:bed127f6071342aabdc8dc1e38cb3363
record_format	dspace
spelling	oai:doaj.org-article:bed127f6071342aabdc8dc1e38cb33632021-11-15T01:19:44ZNew One-Dimensional Search Iteration Algorithm and Engineering Application1875-920310.1155/2021/7643555https://doaj.org/article/bed127f6071342aabdc8dc1e38cb33632021-01-01T00:00:00Zhttp://dx.doi.org/10.1155/2021/7643555https://doaj.org/toc/1875-9203In 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.Yiping LuoJinhao MengDefa WangGuobin XueHindawi LimitedarticlePhysicsQC1-999ENShock and Vibration, Vol 2021 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Physics QC1-999
spellingShingle	Physics QC1-999 Yiping Luo Jinhao Meng Defa Wang Guobin Xue New One-Dimensional Search Iteration Algorithm and Engineering Application
description	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.
format	article
author	Yiping Luo Jinhao Meng Defa Wang Guobin Xue
author_facet	Yiping Luo Jinhao Meng Defa Wang Guobin Xue
author_sort	Yiping Luo
title	New One-Dimensional Search Iteration Algorithm and Engineering Application
title_short	New One-Dimensional Search Iteration Algorithm and Engineering Application
title_full	New One-Dimensional Search Iteration Algorithm and Engineering Application
title_fullStr	New One-Dimensional Search Iteration Algorithm and Engineering Application
title_full_unstemmed	New One-Dimensional Search Iteration Algorithm and Engineering Application
title_sort	new one-dimensional search iteration algorithm and engineering application
publisher	Hindawi Limited
publishDate	2021
url	https://doaj.org/article/bed127f6071342aabdc8dc1e38cb3363
work_keys_str_mv	AT yipingluo newonedimensionalsearchiterationalgorithmandengineeringapplication AT jinhaomeng newonedimensionalsearchiterationalgorithmandengineeringapplication AT defawang newonedimensionalsearchiterationalgorithmandengineeringapplication AT guobinxue newonedimensionalsearchiterationalgorithmandengineeringapplication
_version_	1718428945872846848

New One-Dimensional Search Iteration Algorithm and Engineering Application

Ejemplares similares