Numerical experiments with one-dimensional adaptive cubic algorithm (Q1802495): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Ping-Qi Pan / rank | |||
Property / reviewed by | |||
Property / reviewed by: Ping-Qi Pan / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0898-1221(93)90280-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2001203970 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3678586 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3134860 / rank | |||
Normal rank |
Latest revision as of 17:16, 17 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Numerical experiments with one-dimensional adaptive cubic algorithm |
scientific article |
Statements
Numerical experiments with one-dimensional adaptive cubic algorithm (English)
0 references
21 July 1993
0 references
A one-dimensional version of the cubic algorithm for global optimization, developed by one of the authors, F. A. Galperin, is studied and tested computationally. It is demonstrated that the algorithm is applicable for an univariate Lipschitz continuous function over a closed interval.
0 references
cubic algorithm
0 references
global optimization
0 references
univariate Lipschitz continuous function
0 references