Two Scaling Conjugate Gradient Methods Using the Approximate Optimal Stepsizes for Unconstrained Optimization Problem

Yongjin Kim; Yunchol Jong; Pyongil Choe

doi:10.55578/jdso.2610.010

Login Register

Grace Lee

To enhance your experience, with your consent for all our websites and applications, we (and our partners) store and/or access information on your device (cookies or corresponding information) when you connect. Our website may use these cookies to:

Determine the audience of advertisements on our website without collecting data

Display personalized ads based on your browsing and profile

Personalize our editorial content according to your navigation

Allow you to share content on social networks or platforms on our website

Send you ads based on your location

Accept All

Reject All

Journal of Decision Science and Optimization

Submit Manuscript Sign up for alerts

Home > Volumes and issues > Two Scaling Conjugate Gradient Methods Using the Approximate Optimal Stepsizes for Unconstrained Optimization Problem

412 views 165 downloads

Research Article 13 October 2026

Two Scaling Conjugate Gradient Methods Using the Approximate Optimal Stepsizes for Unconstrained Optimization Problem

Yongjin Kim ¹ , Yunchol Jong ¹

jyc1963@star-co.net.kp

, Pyongil Choe ¹ show author's information

1 : University of Science, Pyongyang, DPR Korea

DOI: 10.55578/jdso.2610.010

Keywords: Unconstrained optimization, approximate optimal stepsize, Barzilai-Borwein method, scaling conjugate gradient method, global convergence

PDF