scientific article; zbMATH DE number 2162935

From MaRDI portal
Publication:4673345





It is known that there exists a strong connection between unconstrained optimization problems and numerical methods for the integration of ordinary differential equations. In this paper it is tried to discover further their links. The main idea is to transform unconstrained problems to equivalent ordinary differential equations. The author proposes the LRKOPT method which is constructed by discretizing the initial value problem of ordinary differential equations. This method is a combination of the second order singly diagonally implicit Runge-Kutta formulas and line search methods. It is proved that the LRKOPT method has the superlinear convergence and global convergence. Numerical results show that the LRKOPT method performs better than the IMPBOT method in terms of function evaluations











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673345)