A globally convergent trust-region algorithm for unconstrained derivative-free optimization (Q747209)
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: A globally convergent trust-region algorithm for unconstrained derivative-free optimization |
scientific article; zbMATH DE number 6497590
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A globally convergent trust-region algorithm for unconstrained derivative-free optimization |
scientific article; zbMATH DE number 6497590 |
Statements
A globally convergent trust-region algorithm for unconstrained derivative-free optimization (English)
0 references
23 October 2015
0 references
The authors present a derivative-free trust-region algorithm for unconstrained optimization problems. The given algorithm is based on the ideas of Powell. It is proved that, under reasonable hypotheses, any accumulation point of the sequence generated by the given algorithm is stationary.
0 references
unconstrained minimization
0 references
trust-region algorithm
0 references
0 references
0 references
0 references
0 references
0.8715676665306091
0 references
0.870493471622467
0 references
0.8638444542884827
0 references
