No label defined (Q4673345)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2162935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2162935 |
Statements
29 April 2005
0 references
global convergence
0 references
superlinear convergence
0 references
Runge-Kutta method
0 references
unconstrained optimization
0 references
singly diagonally implicit Runge-Kutta formulas
0 references
line search methods
0 references
numerical results
0 references
0.7584542632102966
0 references
0.7444641590118408
0 references
0.7382889986038208
0 references
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
0 references