Iterative optimizers : (Record no. 69064)

000 -LEADER
fixed length control field 04762cam a2200601Ii 4500
001 - CONTROL NUMBER
control field on1096435816
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220711203514.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 190412s2019 enka ob 001 0 eng d
019 ## -
-- 1097256212
-- 1097673872
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9781119612360
-- (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 1119612365
-- (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9781119612476
-- (electronic bk. ;
-- oBook)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 1119612470
-- (electronic bk. ;
-- oBook)
029 1# - (OCLC)
OCLC library identifier AU@
System control number 000065306463
029 1# - (OCLC)
OCLC library identifier CHNEW
System control number 001050902
029 1# - (OCLC)
OCLC library identifier CHVBK
System control number 567422550
082 04 - CLASSIFICATION NUMBER
Call Number 519.6
100 1# - AUTHOR NAME
Author Clerc, Maurice,
245 10 - TITLE STATEMENT
Title Iterative optimizers :
Sub Title difficulty measures and benchmarks /
300 ## - PHYSICAL DESCRIPTION
Number of Pages 1 online resource :
490 1# - SERIES STATEMENT
Series statement Computer engineering series
505 8# - FORMATTED CONTENTS NOTE
Remark 2 2.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# - FORMATTED CONTENTS NOTE
Remark 2 6.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# - FORMATTED CONTENTS NOTE
Remark 2 A.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 ## - SUMMARY, ETC.
Summary, etc Almost 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 #7 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Applied.
650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Probability & Statistics
-- General.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1002/9781119612476
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- London :
-- ISTE Ltd. ;
-- Hoboken :
-- John Wiley & Sons, Inc.,
-- 2019.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
588 0# -
-- Online resource; title from PDF title page (EBSCO, viewed April 15, 2019).
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Mathematical optimization.
650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1
-- MATHEMATICS
650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1
-- MATHEMATICS
650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Mathematical optimization.
-- (OCoLC)fst01012099
994 ## -
-- 92
-- DG1

No items available.