Methods of unconditional minimization of functions using a simplex (Q1119477)
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 4099057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Methods of unconditional minimization of functions using a simplex |
scientific article; zbMATH DE number 4099057 |
Statements
Methods of unconditional minimization of functions using a simplex (English)
0 references
1979
0 references
The problem of unconstrained minimization of continuously differentiable convex functions is considered. Two iterative methods are presented, in which the choice of the descending direction is made with the help of an n-dimensional simplex.
0 references
unconstrained minimization
0 references
continuously differentiable convex functions
0 references
n-dimensional simplex
0 references
0.8384250402450562
0 references
0.8236799240112305
0 references
0.8122735023498535
0 references
0.8104793429374695
0 references
0.804311215877533
0 references
