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
โฆ 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
Domain augmentation and reduction in str
โ
George I. N. Rozvany
๐
Article
๐
2011
๐
Springer-Verlag
๐
English
โ 170 KB
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
Domain decomposition and model reduction
โ
Harbir Antil; Matthias Heinkenschloss; Ronald H. W. Hoppe; Danny C. Sorensen
๐
Article
๐
2010
๐
Springer-Verlag
๐
English
โ 545 KB
Strategies for High Risk Reduction and M
โ
Lorenzo Miccoli; Francesca Destefano
๐
Article
๐
2010
๐
Springer
๐
English
โ 328 KB
Global Optimality Conditions and Optimiz
โ
Z. Y. Wu; Y. J. Yang; F. S. Bai; M. Mammadov
๐
Article
๐
2011
๐
Springer
๐
English
โ 620 KB