A gradient-related algorithm with inexact line searches (Q596214)
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 gradient-related algorithm with inexact line searches |
scientific article; zbMATH DE number 2085574
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A gradient-related algorithm with inexact line searches |
scientific article; zbMATH DE number 2085574 |
Statements
A gradient-related algorithm with inexact line searches (English)
0 references
10 August 2004
0 references
The authors present a gradient-related algorithm for solving large-scale unconstrained optimization problems. It is a feasible direction method. The line search direction is selected to be a combination of the current gradient and some previous search directions. The step-size is determined by using various inexact line searches.
0 references
gradient-related algorithm
0 references
inexact line search
0 references
feasible direction method
0 references
unconstrained optimization
0 references
convergence
0 references
