| 000 | 04762cam a2200601Ii 4500 | ||
|---|---|---|---|
| 001 | on1096435816 | ||
| 003 | OCoLC | ||
| 005 | 20220711203514.0 | ||
| 006 | m o d | ||
| 007 | cr cnu|||unuuu | ||
| 008 | 190412s2019 enka ob 001 0 eng d | ||
| 040 |
_aN$T _beng _erda _epn _cN$T _dEBLCP _dN$T _dDG1 _dYDX _dRECBK _dUKAHL _dOCLCF _dOCLCQ |
||
| 019 |
_a1097256212 _a1097673872 |
||
| 020 |
_a9781119612360 _q(electronic bk.) |
||
| 020 |
_a1119612365 _q(electronic bk.) |
||
| 020 |
_a9781119612476 _q(electronic bk. ; _qoBook) |
||
| 020 |
_a1119612470 _q(electronic bk. ; _qoBook) |
||
| 020 | _z9781786304094 | ||
| 020 | _z1786304090 | ||
| 029 | 1 |
_aAU@ _b000065306463 |
|
| 029 | 1 |
_aCHNEW _b001050902 |
|
| 029 | 1 |
_aCHVBK _b567422550 |
|
| 035 |
_a(OCoLC)1096435816 _z(OCoLC)1097256212 _z(OCoLC)1097673872 |
||
| 050 | 4 | _aQA402.5 | |
| 072 | 7 |
_aMAT _x003000 _2bisacsh |
|
| 072 | 7 |
_aMAT _x029000 _2bisacsh |
|
| 082 | 0 | 4 |
_a519.6 _223 |
| 049 | _aMAIN | ||
| 100 | 1 |
_aClerc, Maurice, _eauthor. _98318 |
|
| 245 | 1 | 0 |
_aIterative optimizers : _bdifficulty measures and benchmarks / _cMaurice Clerc. |
| 264 | 1 |
_aLondon : _bISTE Ltd. ; _aHoboken : _bJohn Wiley & Sons, Inc., _c2019. |
|
| 300 |
_a1 online resource : _billustrations (some color) |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 490 | 1 | _aComputer engineering series | |
| 588 | 0 | _aOnline resource; title from PDF title page (EBSCO, viewed April 15, 2019). | |
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | 8 | _a2.7.1. Deceptive vs disappointing2.7.2. Measure consistency; 2.8. Perceived difficulty; 3. Landscape Typology; 3.1. Reliable functions, misleading and neutral; 3.1.1. Dimension D = 1; 3.2. Plateaus; 3.2.1. Dimension D = 1; 3.2.2. Dimension D = 2; 3.3. Multimodal functions; 3.3.1. Functions with single global minimum; 3.3.2. Functions with several global minima; 3.4. Unimodal functions; 4. LandGener; 4.1. Examples; 4.2. Generated files; 4.3. Regular landscape; 5. Test Cases; 5.1. Structure of a representative test case; 5.2. CEC 2005; 5.3. CEC 2011; 6. Difficulty vs Dimension | |
| 505 | 8 | _a6.1. Rosenbrock function6.2. Griewank function; 6.3. Example of the normalized paraboloid; 6.4. Normalized bi-paraboloid; 6.5. Difficulty d0 and dimension; 7. Exploitation and Exploration vs Difficulty; 7.1. Exploitation, an incomplete definition; 7.2. Rigorous definitions; 7.3. Balance profile; 8. The Explo2 Algorithm; 8.1. The algorithm; 8.1.1. Influence of the balance profile; 8.2. Subjective numerical summary of a distribution of results; 9. Balance and Perceived Difficulty; 9.1. Constant profile-based experiments; 9.2. Calculated difficulty vs perceived difficulty; Appendix | |
| 505 | 8 | _aA.12.1. Random sampling in a D-sphereA. 12.2. SunnySpell: potential function; A.12.3. Valuex: evaluation for a LandGener landscape; A.12.4. Multiparaboloid generation; A.13. LandGener landscapes; A.13.1. T1 deceptive; A.13.2. T2 deceptive; A.13.3. T3 deceptive; A.13.4. T4 deceptive; A.13.5. T5 deceptive; References; Index; Other titles from iSTE in Computer Engineering; EULA | |
| 520 | _aAlmost every month, a new optimization algorithm is proposed, often accompanied by the claim that it is superior to all those that came before it. However, this claim is generally based on the algorithm's performance on a specific set of test cases, which are not necessarily representative of the types of problems the algorithm will face in real life. This book presents the theoretical analysis and practical methods (along with source codes) necessary to estimate the difficulty of problems in a test set, as well as to build bespoke test sets consisting of problems with varied difficulties. The book formally establishes a typology of optimization problems, from which a reliable test set can be deduced. At the same time, it highlights how classic test sets are skewed in favor of different classes of problems, and how, as a result, optimizers that have performed well on test problems may perform poorly in real life scenarios. | ||
| 650 | 0 |
_aMathematical optimization. _94112 |
|
| 650 | 7 |
_aMATHEMATICS _xApplied. _2bisacsh _95811 |
|
| 650 | 7 |
_aMATHEMATICS _xProbability & Statistics _xGeneral. _2bisacsh _95812 |
|
| 650 | 7 |
_aMathematical optimization. _2fast _0(OCoLC)fst01012099 _94112 |
|
| 655 | 4 |
_aElectronic books. _93294 |
|
| 776 | 0 | 8 |
_iPrint version: _aClerc, Maurice. _tIterative optimizers. _dLondon : ISTE Ltd. ; Hoboken : John Wiley & Sons, Inc., 2019 _z1786304090 _z9781786304094 _w(OCoLC)1089862644 |
| 830 | 0 |
_aComputer engineering series (London, England) _98319 |
|
| 856 | 4 | 0 |
_uhttps://doi.org/10.1002/9781119612476 _zWiley Online Library |
| 942 | _cEBK | ||
| 994 |
_a92 _bDG1 |
||
| 999 |
_c69064 _d69064 |
||