1977
DOI: 10.1137/0714019
|View full text |Cite
|
Sign up to set email alerts
|

Systematic Search in High Dimensional Sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
9
0

Year Published

1981
1981
2009
2009

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 46 publications
(9 citation statements)
references
References 1 publication
0
9
0
Order By: Relevance
“…This result exhibits the superiority of T. Aird and J. Rice procedure ZSRCH (IMSL library [1]) over Sobol's approach [7] for solving (0.3).…”
mentioning
confidence: 53%
“…This result exhibits the superiority of T. Aird and J. Rice procedure ZSRCH (IMSL library [1]) over Sobol's approach [7] for solving (0.3).…”
mentioning
confidence: 53%
“…Each optimization problem is solved for 20 different sets of initial conditions, which span the feasible space of the design variables, evaluated using an algorithm that optimizes the dispersion of the set [27]. From within these results, the solution that finds the lower local minimum is defined as the solution of the optimal problem.…”
Section: Definition Of the Optimal Problemmentioning
confidence: 99%
“…Furthermore, to ensure that the global (instead of a local) optimum is found for ð _ P m Þ Q d in Problem IIa, for each test problem the subroutine BCPOL is executed with 100 different initial points (noting that ð _ P m Þ Q d has only three decision variables). These 100 different initial points are generated with the IMSL subroutine GGUES, which uses Aird and Rice's (1977) procedure to systematically disperse a given number of initial points over a multi-dimensional space. Table 2 presents results for problems with the parameter values of p ¼ 4; s ¼ 0:5; k ¼ 0:2; and r l ¼ 5 to 30 in steps of 5:…”
Section: Numerical Illustrations and Generalizable Behaviormentioning
confidence: 99%