On the Extension of Dai-Liao Conjugate Gradient Method for Vector Optimization.
Saved in:
| Title: | On the Extension of Dai-Liao Conjugate Gradient Method for Vector Optimization. |
|---|---|
| Authors: | Hu, Qingjie1,2,3 (AUTHOR) hqj0715@126.com.cn, Li, Ruyun1,2,3 (AUTHOR) liruyun2023@163.com, Zhang, Yanyan1,2,3 (AUTHOR), Zhu, Zhibin1,2,3 (AUTHOR) |
| Source: | Journal of Optimization Theory & Applications. Oct2024, Vol. 203 Issue 1, p810-843. 34p. |
| Subjects: | Vector valued functions, Convex functions, Conjugate gradient methods |
| Abstract: | In this paper, we extend the Dai-Liao conjugate gradient method to vector optimization. Firstly, we analyze the global convergence of the direct extension version of the Dai-Liao conjugate gradient method for K-strongly convex vector functions. Secondly, we investigate the global convergence of the vector version of restricted non-negative Dai-Liao conjugate gradient method for general vector functions. Additionally, we discuss the global convergence of the vector version of modified Dai-Liao conjugate gradient method for general vector functions. Finally, numerical experiments demonstrate that the proposed conjugate gradient methods are effective for solving vector optimization problems. In particular, these methods can effectively generate the Pareto frontiers for the test problems. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Optimization Theory & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In this paper, we extend the Dai-Liao conjugate gradient method to vector optimization. Firstly, we analyze the global convergence of the direct extension version of the Dai-Liao conjugate gradient method for K-strongly convex vector functions. Secondly, we investigate the global convergence of the vector version of restricted non-negative Dai-Liao conjugate gradient method for general vector functions. Additionally, we discuss the global convergence of the vector version of modified Dai-Liao conjugate gradient method for general vector functions. Finally, numerical experiments demonstrate that the proposed conjugate gradient methods are effective for solving vector optimization problems. In particular, these methods can effectively generate the Pareto frontiers for the test problems. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00223239 |
| DOI: | 10.1007/s10957-024-02535-x |
