TOWARDS PURE ADAPTIVE SEARCH

被引：5

作者：

BARITOMPA, WP

BAOPING, Z

MLADINEO, RH

WOOD, GR

ZABINSKY, ZB

机构：

[1] UNIV CANTERBURY,DEPT MATH,CHRISTCHURCH 1,NEW ZEALAND

[2] RIDER UNIV,LAWRENCEVILLE,NJ

[3] CENT QUEENSLAND UNIV,DEPT MATH & COMP,ROCKHAMPTON,QLD 4702,AUSTRALIA

[4] UNIV WASHINGTON,IND ENGN PROGRAM,SEATTLE,WA 98195

来源：

JOURNAL OF GLOBAL OPTIMIZATION | 1995年 / 7卷 / 01期

关键词：

GLOBAL OPTIMIZATION; STOCHASTIC; RANDOM SEARCH; LOCALIZATION; COMPLEXITY;

D O I：

10.1007/BF01100207

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The algorithm known as Pure Adaptive Search is a global optimisation ideal with desirable complexity. In this paper we temper it to a framework we term Somewhat Adaptive Search. This retains the desirable complexity, but allows scope for a practical realisation. We introduce a new algorithm termed Pure Localisation Search which attempts to reach the practical ideal. For a certain class of one variable functions the gap is bridged.

引用

页码：93 / 110

页数：18

共 17 条

[1]

ARCHETTI F, 1978, GLOBAL OPTIMISATION, V2

[2] CUSTOMIZING METHODS FOR GLOBAL OPTIMIZATION - A GEOMETRIC VIEWPOINT [J].