A nonsmooth global optimization technique using slopes: The one-dimensional case (Q1304345)
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 1339672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A nonsmooth global optimization technique using slopes: The one-dimensional case |
scientific article; zbMATH DE number 1339672 |
Statements
A nonsmooth global optimization technique using slopes: The one-dimensional case (English)
0 references
22 September 1999
0 references
The author describes a method for computing verified enclosures for the global minimum and all global minimum points of a nonsmooth one-dimensional function subject to bound constraints. The method incorporates a special pruning step generated by interval slopes. This pruning step can be utilized as an accelerating device similar to the monotonicity test frequently used in interval methods for smooth problems. It offers the possibility to cut away a large part of the current box irrespective of the fact that the slope interval contains zero or not.
0 references
nonsmooth global optimization
0 references
interval slopes
0 references
monotonicity test
0 references
interval methods
0 references
0.88597643
0 references
0 references
0.8715662
0 references
0.86904097
0 references
0.8688871
0 references
0.8654308
0 references
0.8638464
0 references
