Optimal Hybrid Bfgs-Cg Method for Unconstrained Optimization
O. M. Bamigbola, O. O. Okundalaye, C. N. Ejieji
Asian Research Journal of Mathematics · pp. 1–18 · Published 9 Apr 2018
10.9734/ARJOM/2018/39293Abstract
In solving unconstrained optimization problems, both quasi-Newton and conjugate gradient methods are known to be efficient methods. Hence, the optimal hybrid Broyden-Fletcher- Goldfarb-Shanno-Conjugate Gradient (OBFGS-CG) method is proposed in this work, which combines the strengths of both BFGS and CG methods. The optimal hybrid BFGS-CG method is based on an existing hybrid BFGS-CG method. The optimal BFGS-CG paramter, when utilised in solving unconstrained optimization problems, resulted in improvement in the total number of iterations and CPU time.
Cited by 0
No indexed citations yet.
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
0
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
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.