English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In a class of solving unconstrained optimization problems, the conjugate gradient method has been proved to be efficient by researchers’ due to it’s smaller storage requirements and computational cost. Then, a class of penalty algorithms based on three-term conjugate gradient methods was developed and extend to find solution of an unconstrained minimization portfolio management problems, where the objective function is a piecewise quadratic polynomial. By implementing the proposed algorithm to solve some selected unconstrained optimization problems, resulted in improvement in the total number of iterations and CPU time. It was shown that this algorithm is promising. *Corresponding author: E-mail: samsonakinwale@yahoo.co.uk, E-mail: okundalaye.oluwaseun@aaua.edu.ng Akinwale and Okundalaye; JAMCS, 31(6): 1-13, 2019; Article no.JAMCS.46074

Penalty Algorithm Based on Three-Term Conjugate Gradient Method for Unconstrained Optimization Portfolio Management Problems