@Article{JCM-23-2,
author = {},
title = {Singly Diagonally Implicit Runge-Kutta Methods Combining Line Search Techniques for Unconstrained Optimization},
journal = {Journal of Computational Mathematics},
year = {2005},
volume = {23},
number = {2},
pages = {153--164},
abstract = {<p style="text-align: justify;">There exists a strong connection between numerical methods for the integration of ordinary differential equations and optimization problems. In this paper, we try to discover further their links. And we transform unconstrained problems to the equivalent ordinary differential equations and construct the LRKOPT method to solve them by combining the second order singly diagonally implicit Runge-Kutta formulas and line search techniques. Moreover, we analyze the global convergence and the local convergence of the LRKOPT method. Promising numerical results are also reported.</p>},
issn = {1991-7139},
doi = {https://doi.org/2005-JCM-8803},
url = {https://global-sci.com/article/85134/singly-diagonally-implicit-runge-kutta-methods-combining-line-search-techniques-for-unconstrained-optimization}
}