國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Iterative optimizersdifficulty measu...

Clerc, Maurice.

Iterative optimizersdifficulty measures and benchmarks /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Iterative optimizersMaurice Clerc.
其他題名:	difficulty measures and benchmarks /
作者:	Clerc, Maurice.
出版者:	London :ISTE ;2019.
面頁冊數:	1 online resource :ill. (some col.)
標題:	Mathematical optimization.
電子資源:	https://onlinelibrary.wiley.com/doi/book/10.1002/9781119612476
ISBN:	9781119612476$q(electronic bk. ;$qoBook)

Iterative optimizersdifficulty measures and benchmarks /
Clerc, Maurice.

Iterative optimizersdifficulty measures and benchmarks /[electronic resource] :Maurice Clerc. - 1st ed. - London :ISTE ;2019. - 1 online resource :ill. (some col.) - Computer engineering series. - Computer engineering series (London, England).

Includes bibliographical references and index.

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.

ISBN: 9781119612476$q(electronic bk. ;$qoBook)Subjects--Topical Terms:

183292
Mathematical optimization.

LC Class. No.: QA402.5

Dewey Class. No.: 519.6

Iterative optimizersdifficulty measures and benchmarks /
LDR:01895cmm a2200277 a 4500 001 606143
003 OCoLC
005 20190517032520.6
006 m o d
007 cr cnu---unuuu
008 211203s2019 enka ob 001 0 eng d
020 $a 9781119612476$q(electronic bk. ;$qoBook)
020 $a 9781119612360$q(electronic bk.)
020 $z 9781786304094
035 $a 1096435816
040 $a N $b eng $c N $d EBLCP $d N $d DG1 $d YDX $d RECBK $d UKAHL
050 4 $a QA402.5
082 0 4 $a 519.6 $2 23
100 1 $a Clerc, Maurice. $3 721905
245 1 0 $a Iterative optimizers $h [electronic resource] : $b difficulty measures and benchmarks / $c Maurice Clerc.
250 $a 1st ed.
260 $a London : $b ISTE ; $a Hoboken, NJ : $b John Wiley & Sons, $c 2019.
300 $a 1 online resource : $b ill. (some col.)
490 1 $a Computer engineering series
504 $a Includes bibliographical references and index.
520 $a 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.
588 $a Description based on print version record.
650 0 $a Mathematical optimization. $3 183292
830 0 $a Computer engineering series (London, England) $3 722579
856 4 0 $u https://onlinelibrary.wiley.com/doi/book/10.1002/9781119612476