Two Scaling Conjugate Gradient Methods Using the Approximate Optimal Stepsizes for Unconstrained Optimization Problem
Journal of Decision Science and Optimization · 2026
DOI: 10.55578/jdso.2610.010 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Decision Science and Optimization, 2026. Verfasst von Yongjin Kim und 2 weiteren Autor:innen.
Abstract (Originalsprache)
This paper proposes a new method, which combines the gradient method using the approximately optimal stepsizes with the Barzilai and Borwein scaling conjugate gradient method, and propose two scaling conjugate gradient methods for nonlinear unconstrained optimization problems. And then, the sufficient descent property and the global convergence are proved under some reasonable conditions and the standard Wolfe line search. We give some preliminary numerical results to show the effectiveness of the proposed method.
Zitieren
APA
Kim, Y., Jong, Y., & Choe, P. (2026). Two Scaling Conjugate Gradient Methods Using the Approximate Optimal Stepsizes for Unconstrained Optimization Problem. Journal of Decision Science and Optimization. https://doi.org/10.55578/jdso.2610.010
Vancouver
Kim Y, Jong Y, Choe P. Two Scaling Conjugate Gradient Methods Using the Approximate Optimal Stepsizes for Unconstrained Optimization Problem. Journal of Decision Science and Optimization. 2026. doi:10.55578/jdso.2610.010
BibTeX
@article{Kim2026,
author = {Kim, Yongjin and Jong, Yunchol and Choe, Pyongil},
title = {Two Scaling Conjugate Gradient Methods Using the Approximate Optimal Stepsizes for Unconstrained Optimization Problem},
journal = {Journal of Decision Science and Optimization},
year = {2026},
doi = {10.55578/jdso.2610.010}
}
EUVIMED