๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Global optimization problems and domain reduction strategies

โœ Scribed by Alberto Caprara; Marco Locatelli


Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
196 KB
Volume
125
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Set separation problems and global optim
โœ James E. Falk; Yelena Dandurova; Lana Yeganova ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 372 KB

Given a pair of finite, disjoint sets and in , a fundamental problem with numerous applications is to find a simple function () defined over which separates the sets in the sense that () > 0 for all โˆˆ and () < 0 for all โˆˆ . This can always be done (e.g., with the piecewise linear function defined by

Global and local date reduction strategi
โœ U.A. Wever ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 353 KB

Global and local algorithms are developed, which minimize the number of knots of approximating cubic spline functions within a given deviation in the uniform norm. The global algorithm leads to a good approach to the minimum number of knots. The local algorithm saves computing time but generally lea