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

Samson Akinwale *

Department of Banking and nances, Adekunle Ajasin University (AAUA), Nigeria.

O. O. Okundalaye

Department of Mathematical Sciences, Adekunle Ajasin University (AAUA), Nigeria.

*Author to whom correspondence should be addressed.


Abstract

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 and 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.

Keywords: Three-term conjugate gradient, portfolio management, unconstrained optimization and biobjectives optimization.


How to Cite

Akinwale, Samson, and O. O. Okundalaye. 2019. “Penalty Algorithm Based on Three-Term Conjugate Gradient Method for Unconstrained Optimization Portfolio Management Problems”. Journal of Advances in Mathematics and Computer Science 31 (6):1-13. https://doi.org/10.9734/jamcs/2019/v31i630129.

Downloads

Download data is not yet available.