Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants (Q5470225): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962898795 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1103.2056 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:24, 20 April 2024
scientific article; zbMATH DE number 5029002
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants |
scientific article; zbMATH DE number 5029002 |
Statements
Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants (English)
0 references
30 May 2006
0 references
global optimization
0 references
black-box functions
0 references
derivative free methods
0 references
diagonal partitions
0 references
Lipschitz optimization problem
0 references
algorithm
0 references
numerical examples
0 references
