Methods of unconditional minimization of functions using a simplex (Q1119477)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Methods of unconditional minimization of functions using a simplex |
scientific article |
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
