Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (Q5963229)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6550150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints |
scientific article; zbMATH DE number 6550150 |
Statements
Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (English)
0 references
4 March 2016
0 references
global optimization
0 references
\texttt{DISIMPL} algorithm
0 references
\texttt{DIRECT} algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.89387214
0 references
0.8777467
0 references
0.8703877
0 references
0.8674981
0 references
0.86094904
0 references
0.8588829
0 references
