A gradient-related algorithm with inexact line searches (Q596214): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cam.2003.10.025 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075234876 / rank | |||
Normal rank | |||
Revision as of 18:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A gradient-related algorithm with inexact line searches |
scientific article |
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
