A Note on the Convergence Rate of the Nonmonotone Adaptive Cubic Regularization Method
Pacific Journal of Optimization · 2026 · 2
DOI: 10.61208/pjo-2026-002 ↗Kurz gefasst
Fachartikel in der Zeitschrift Pacific Journal of Optimization, 2026. Verfasst von Bai Jianchao und 1 weiteren Autor:innen.
Abstract (Originalsprache)
(Communicated by Xinmin Yang) This note is to analyze the linear convergence rate of the algorithm proposed in [Li, Q., Zheng, B., Zheng, Y.T.: An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem. Appl. Math. Lett. 98, 74-80 (2019)] under the assumption that the objective function is strongly convex.
Zitieren
APA
Jianchao, B., & Qixuan, S. (2026). A Note on the Convergence Rate of the Nonmonotone Adaptive Cubic Regularization Method. Pacific Journal of Optimization, 2. https://doi.org/10.61208/pjo-2026-002
Vancouver
Jianchao B, Qixuan S. A Note on the Convergence Rate of the Nonmonotone Adaptive Cubic Regularization Method. Pacific Journal of Optimization. 2026:2. doi:10.61208/pjo-2026-002
BibTeX
@article{Jianchao2026,
author = {Jianchao, Bai and Qixuan, Sun},
title = {A Note on the Convergence Rate of the Nonmonotone Adaptive Cubic Regularization Method},
journal = {Pacific Journal of Optimization},
year = {2026},
pages = {2},
doi = {10.61208/pjo-2026-002}
}
EUVIMED