Branch and bound algorithms for maximizing expected improvement functions (Q710752): Difference between revisions

@@ Property / arXiv ID @@
+.0804
@@ Property / arXiv ID: 1003.0804 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems
+Normal rank
@@ Property / cites work @@
+Q4079017
@@ Property / cites work: Q4079017 / rank @@
+Normal rank
@@ Property / cites work @@
+A taxonomy of global optimization methods based on response surfaces
+Normal rank
@@ Property / cites work @@
+Efficient global optimization of expensive black-box functions
+Normal rank
@@ Property / cites work @@
+Branch-and-Bound Methods: A Survey
@@ Property / cites work: Branch-and-Bound Methods: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Global optimization to prescribed accuracy
@@ Property / cites work: Global optimization to prescribed accuracy / rank @@
+Normal rank
@@ Property / cites work @@
+Design and analysis of computer experiments. With comments and a rejoinder by the authors
+Normal rank
@@ Property / cites work @@
+The design and analysis of computer experiments.
@@ Property / cites work: The design and analysis of computer experiments. / rank @@
+Normal rank
@@ Property / cites work @@
+On the design of optimization strategies based on global response surface approximation models
+Normal rank
@@ Property / cites work @@
+Interpolation of spatial data. Some theory for kriging
+Normal rank
@@ Property / cites work @@
+An informational approach to the global optimization of expensive-to-evaluate functions
+Normal rank