Conjugate gradient path method without line search technique for derivative-free unconstrained optimization (Q501963)
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: Conjugate gradient path method without line search technique for derivative-free unconstrained optimization |
scientific article; zbMATH DE number 6673278
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conjugate gradient path method without line search technique for derivative-free unconstrained optimization |
scientific article; zbMATH DE number 6673278 |
Statements
Conjugate gradient path method without line search technique for derivative-free unconstrained optimization (English)
0 references
10 January 2017
0 references
The authors propose a conjugate gradient path method combined with derivative-free techniques for solving the unsconstrained nonlinear minimization of nonlinear functions. The technique is based on the use of quadratic polynomials to approximate the function to be optimized.
0 references
conjugate gradient method
0 references
derivative-free optimization
0 references
0 references
0 references
0 references
0 references
0.7900237441062927
0 references
0.7873551249504089
0 references
0.7789852619171143
0 references
