Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (Q5963229): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11590-014-0772-4 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-014-0772-4 / rank | |||
Normal rank | |||
Revision as of 15:01, 8 December 2024
scientific article; zbMATH DE number 6550150
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
