The application of conjugate gradient methods to optimize 3D printed parameters
The Conjugate Gradient (CG) method stands as an evolved computational technique designed for addressing unconstrained optimization problems. Its attractiveness stems from its simplicity, making it straightforward to implement, and its proven track record in effectively addressing real-world applicat...
保存先:
| 主要な著者: | , , , , , , |
|---|---|
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
Semarak Ilmu Publishing
2024
|
| オンライン･アクセス: | http://eprints.utem.edu.my/id/eprint/27840/2/0268711072024141822894.pdf http://eprints.utem.edu.my/id/eprint/27840/ https://semarakilmu.com.my/journals/index.php/appl_mech/article/view/7079 https://doi.org/10.37934/aram.120.1.136141 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 要約: | The Conjugate Gradient (CG) method stands as an evolved computational technique designed for addressing unconstrained optimization problems. Its attractiveness stems from its simplicity, making it straightforward to implement, and its proven track record in effectively addressing real-world applications. Despite the recent surge in interest in this field, certain newer versions of the CG algorithm have failed to outperform the efficiency of their predecessors. Consequently, this paper introduces a fresh CG variant that upholds essential properties of the original CG methods, including sufficient descent and global convergence. In this paper, three types of new CG coefficients are presented with applications in optimizing data. Numerical experiments show that the proposed methods have succeeded in solving problems under exact line search conditions. |
|---|