Choosing descent directions in unconstrained minimization problems (Q909994)
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 4138651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Choosing descent directions in unconstrained minimization problems |
scientific article; zbMATH DE number 4138651 |
Statements
Choosing descent directions in unconstrained minimization problems (English)
0 references
1989
0 references
The author introduces the concept of the best descent direction with respect to a given set from \({\mathbb{R}}^ n\), for a directionally differentiable function of n variables. Then he proposes two algorithms for unconstrained minimization of convex differentiable functions and he proves corresponding convergence results.
0 references
best descent direction
0 references
unconstrained minimization
0 references
0.8177818059921265
0 references
0.8172575831413269
0 references
0.8104793429374695
0 references
0.8031681776046753
0 references
0.8013351559638977
0 references
