Frame based methods for unconstrained optimization (Q5925722): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
This paper describes a wide class of direct search methods for unconstrained optimization, which make use of fragments of grids called frames. Convergence is shown under mild conditions which allow successive frames to be popd, pop popd, and scaled relative to one another. | |||
| Property / review text: This paper describes a wide class of direct search methods for unconstrained optimization, which make use of fragments of grids called frames. Convergence is shown under mild conditions which allow successive frames to be popd, pop popd, and scaled relative to one another. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Klaus Schittkowski / rank | |||
Normal rank | |||
Revision as of 16:37, 21 December 2023
scientific article; zbMATH DE number 1566508
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Frame based methods for unconstrained optimization |
scientific article; zbMATH DE number 1566508 |
Statements
Frame based methods for unconstrained optimization (English)
0 references
19 February 2001
0 references
derivative free optimization
0 references
positive basis methods
0 references
convergence analysis
0 references
frame based methods
0 references
direct search methods
0 references
unconstrained optimization
0 references
This paper describes a wide class of direct search methods for unconstrained optimization, which make use of fragments of grids called frames. Convergence is shown under mild conditions which allow successive frames to be popd, pop popd, and scaled relative to one another.
0 references
