Skip to content
Research Article Open access CC BY 4.0

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

Samson Akinwale, O. O. Okundalaye

Journal of Advances in Mathematics and Computer Science · pp. 1–13 · Published 22 Apr 2019

10.9734/jamcs/2019/v31i630129

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.

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

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

6

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.