One-dimensional analogue of the global optimality criterion (Q5935348)
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: One-dimensional analogue of the global optimality criterion |
scientific article; zbMATH DE number 1610078
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One-dimensional analogue of the global optimality criterion |
scientific article; zbMATH DE number 1610078 |
Statements
One-dimensional analogue of the global optimality criterion (English)
0 references
2 December 2002
0 references
It is known that the integer global optimization algorithm is applicable to large classes of nonconvex nonsmooth problems. However, this application has a number of difficulties, related to determining some of the characteristics. Some useful theorems are proved in this connection in the article. These results are applied to an iterative one-dimensional analogue of the global optimization algorithm.
0 references
global optimality
0 references
nonconvex nonsmooth problems
0 references
measure based global optimization
0 references
0.7940762042999268
0 references
0.7662776112556458
0 references
0.7662776112556458
0 references
