article · PLoS ONE
The spectral conjugate gradient (SCG) technique is highly efficient in addressing large-scale unconstrained optimization challenges. This paper presents a structured SCG approach that combines the Quasi-Newton direction and an extended conjugacy condition. Drawing inspiration from the Fletcher-Reeves conjugate gradient (CG) parameter, this method is tailored to improve the general structure of the CG approach. We rigorously establish the global convergence of the algorithm for general functions, using criteria from a Wolfe-line search. Numerical experiments performed on some unconstrained optimization problems highlight the superiority of this new algorithm over certain CG methods with similar characteristics. In the context of portfolio selection, the proposed method extended to address the problem of stock allocation, ensuring optimized returns while minimizing risks. Empirical evaluations demonstrate the efficiency of the method, demonstrating significant improvements in computational efficiency and optimization outcomes.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.1371/journal.pone.0320416
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.