Nonsmooth nonconvex global optimization in a Banach space with a basis (Q1767923)
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: Nonsmooth nonconvex global optimization in a Banach space with a basis |
scientific article; zbMATH DE number 2142451
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonsmooth nonconvex global optimization in a Banach space with a basis |
scientific article; zbMATH DE number 2142451 |
Statements
Nonsmooth nonconvex global optimization in a Banach space with a basis (English)
0 references
8 March 2005
0 references
An algorithm is proposed for global minimization of a nonconvex function over a nonconvex (so-called inf-robust) set. The main idea of the algorithm's steps consists in decomposing the level sets into subsets, computing mean values of the objective function over each subset and taking the smallest of them as new level constant. Theoretical convergence of the algorithm is verified.
0 references
global optimization
0 references
level set contraction
0 references
0 references
0.7626559138298035
0 references
0.7573439478874207
0 references
0.7573439478874207
0 references
