On the convergence of curvilinear search algorithms in unconstrained optimization (Q1061006)
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: On the convergence of curvilinear search algorithms in unconstrained optimization |
scientific article; zbMATH DE number 3908180
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the convergence of curvilinear search algorithms in unconstrained optimization |
scientific article; zbMATH DE number 3908180 |
Statements
On the convergence of curvilinear search algorithms in unconstrained optimization (English)
0 references
1985
0 references
The purpose of this paper is to unify the conditions under which curvilinear algorithms for unconstrained optimization converge. Particularly, two gradient path approximation algorithms and a trust region curvilinear algorithm are examined in this context.
0 references
curvilinear algorithms
0 references
unconstrained optimization
0 references
gradient path approximation algorithms
0 references
trust region curvilinear algorithm
0 references
0 references
