A MODIFIED NONLINEAR CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION AND PORTFOLIO SELECTION PROBLEMS
Conjugate gradient methods play a vital role in finding solutions of large-scale optimization problems due to their simplicity to implement, low memory requirements and as well as their convergence properties. In this paper, we propose a new conjugate gradient method that has a direction satisfying...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2023
|
Subjects: | |
Online Access: | View Fulltext in Publisher View in Scopus |
LEADER | 02042nam a2200373Ia 4500 | ||
---|---|---|---|
001 | 10.1051-ro-2023037 | ||
008 | 230529s2023 CNT 000 0 und d | ||
020 | |a 28047303 (ISSN) | ||
245 | 1 | 0 | |a A MODIFIED NONLINEAR CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION AND PORTFOLIO SELECTION PROBLEMS |
260 | 0 | |b EDP Sciences |c 2023 | |
300 | |a 19 | ||
856 | |z View Fulltext in Publisher |u https://doi.org/10.1051/ro/2023037 | ||
856 | |z View in Scopus |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-85158872938&doi=10.1051%2fro%2f2023037&partnerID=40&md5=561984b9d627a90bd278a28f37ad5846 | ||
520 | 3 | |a Conjugate gradient methods play a vital role in finding solutions of large-scale optimization problems due to their simplicity to implement, low memory requirements and as well as their convergence properties. In this paper, we propose a new conjugate gradient method that has a direction satisfying the sufficient descent property. We establish global convergence of the new method under the strong Wolfe line search conditions. Numerical results show that the new method performs better than other relevant methods in the literature. Furthermore, we use the new method to solve a portfolio selection problem. © The authors. Published by EDP Sciences, ROADEF, SMAI 2023. | |
650 | 0 | 4 | |a Conjugate gradient |
650 | 0 | 4 | |a Conjugate gradient method |
650 | 0 | 4 | |a Conjugate-gradient method |
650 | 0 | 4 | |a Finding solutions |
650 | 0 | 4 | |a global convergence |
650 | 0 | 4 | |a Global conver-gence |
650 | 0 | 4 | |a Nonlinear conjugate gradient algorithms |
650 | 0 | 4 | |a Nonlinear programming |
650 | 0 | 4 | |a Numerical methods |
650 | 0 | 4 | |a portfolio selection |
650 | 0 | 4 | |a Portfolio selection |
650 | 0 | 4 | |a Portfolio selection problems |
650 | 0 | 4 | |a strong Wolfe line search |
650 | 0 | 4 | |a Strong wolfe line search |
650 | 0 | 4 | |a Unconstrained optimization |
650 | 0 | 4 | |a Wolfe line searches |
700 | 1 | 0 | |a Diphofu, T. |e author |
700 | 1 | 0 | |a Kaelo |e author |
700 | 1 | 0 | |a Tufa, A.R. |e author |
773 | |t RAIRO - Operations Research |