Local tuning and partition strategies for diagonal GO methods (Q1402152)
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: Local tuning and partition strategies for diagonal GO methods |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local tuning and partition strategies for diagonal GO methods |
scientific article |
Statements
Local tuning and partition strategies for diagonal GO methods (English)
0 references
19 August 2003
0 references
A one-dimensional global optimization method (GO) using local tuning on the behavior of the objective function is generalized to form a new diagonal algorithm for solving multi-dimensional global optimization problems using bisection strategy. Conditions for global convergence of the proposed algorithm are established. Numerical results reported demonstrate that the new algorithm using estimates of local Lipschitz constants over different subregions outperformed the traditional approach.
0 references
global optimization
0 references
hyperinterval
0 references
diagonal methods
0 references
algorithm
0 references
bisection strategy
0 references
global convergence
0 references
numerical results
0 references
0.8412294
0 references
0.8356313
0 references
0.8187068
0 references
0.7959849
0 references
0.7901384
0 references
0.78889036
0 references
