A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies (Q427360)
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: A convergent simplicial algorithm with -subdivision and -bisection strategies |
scientific article; zbMATH DE number 6046167
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies |
scientific article; zbMATH DE number 6046167 |
Statements
A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies (English)
0 references
13 June 2012
0 references
global optimization
0 references
convex maximization
0 references
branch-and-bound
0 references
simplicial algorithm
0 references
subdivision strategy
0 references
0 references
0 references
0 references
0.9127956628799438
0 references
0.842497706413269
0 references
0.8418265581130981
0 references
0.8350632786750793
0 references
