New Hybrid CG Algorithm Based on PR and FR Steps | Zendy

Abbas Al-Bayati | Zendy; Khalil K. Abbo | Zendy; Asma Abdalah | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

New Hybrid CG Algorithm Based on PR and FR Steps

Author(s) -

Abbas Al-Bayati,

Khalil K. Abbo,

Asma Abdalah

Publication year - 2005

Publication title -

maǧallaẗ al-rāfidayn li-ʿulūm al-ḥāsibāt wa-al-riyāḍiyyāẗ/al-rafidain journal for computer sciences and mathematics

Language(s) - English

Resource type - Journals

eISSN - 2311-7990

pISSN - 1815-4816

DOI - 10.33899/csmj.2005.164065

Subject(s) - conjugate gradient method , algorithm , computation , computer science , hybrid algorithm (constraint satisfaction) , optimization algorithm , mathematical optimization , mathematics , artificial intelligence , constraint satisfaction , probabilistic logic , constraint logic programming

In this paper, a new hybrid conjugate gradient algorithm is proposed for unconstrained optimization. This algorithm combines the desirable computation aspects of Polak-Ribier steps and useful theoretical features of Fletcher-Reeves CG-steps. Computational results for this algorithm are given and compared with those of the Fletcher and Polak standard CG methods showing a considerable improvement over the latter two methods.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research