Precision, complexity, and computational schemes of the cubic algorithms (Q1090611)
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: Precision, complexity, and computational schemes of the cubic algorithms |
scientific article; zbMATH DE number 4008117
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Precision, complexity, and computational schemes of the cubic algorithms |
scientific article; zbMATH DE number 4008117 |
Statements
Precision, complexity, and computational schemes of the cubic algorithms (English)
0 references
1988
0 references
The cubic algorithm [see the author, J. Math. Anal. Appl. 112, 635-640 (1985; Zbl 0588.65042)] is a nongradient method for the solution of multi-extremal, nonconvex Lipschitzian optimization problems. The precision and complexity of this algorithm are studied, and improved computational schemes are proposed.
0 references
cubic algorithm
0 references
nongradient method
0 references
multi-extremal, nonconvex Lipschitzian optimization
0 references
derivative-free optimization
0 references
