A new method of moving asymptotes for large-scale unconstrained optimization (Q2518690)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new method of moving asymptotes for large-scale unconstrained optimization |
scientific article; zbMATH DE number 5493164
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new method of moving asymptotes for large-scale unconstrained optimization |
scientific article; zbMATH DE number 5493164 |
Statements
A new method of moving asymptotes for large-scale unconstrained optimization (English)
0 references
16 January 2009
0 references
This article presents a method of moving asymptotes to solve large-scale unconstrained optimization problems of a twice continuously differentiable function. The authors begin with a brief introduction to this general problem and a survey of the relevant literature on moving asymptote methods including several useful theorems. In the third section the authors present their innovative algorithm and prove its convergence. The article concludes with a series of tables presenting the results of the numerical experimentation, ideas for future extensions and a list of relevant references.
0 references
method of moving asymptotes
0 references
trust region
0 references
linear search
0 references
large scale optimization
0 references
unconstrained optimization
0 references
algorithm
0 references
convergence
0 references
numerical experimentation
0 references
0.8680254220962524
0 references
0.813155472278595
0 references
0.8000339865684509
0 references
0.7845777869224548
0 references