An algorithm for unconstrained optimization (Q4032911)
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 164989
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for unconstrained optimization |
scientific article; zbMATH DE number 164989 |
Statements
An algorithm for unconstrained optimization (English)
0 references
16 May 1993
0 references
superlinear convergence rate
0 references
quasi-Newton algorithm
0 references
unconstrained optimization
0 references
0.97620463
0 references
0.94993556
0 references
0.93415827
0 references
0 references
A new quasi-Newton algorithm for solving unconstrained optimization problems on \(R^ n\) is presented. The algorithm is based on a modification of the Newton method. The rate of convergence of the suggested algorithm is shown to be superlinear. Numerical results and some computational experience with the new algorithm is reported.
0 references