Precision, complexity, and computational schemes of the cubic algorithms (Q1090611): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The cubic algorithm / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:17, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Precision, complexity, and computational schemes of the cubic algorithms |
scientific article |
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
