2017
DOI: 10.1007/978-3-319-68913-5_1
|View full text |Cite
|
Sign up to set email alerts
|

Introduction: Tools and Challenges in Derivative-Free and Blackbox Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(16 citation statements)
references
References 129 publications
0
16
0
Order By: Relevance
“…Global optimization methods attempt to find the global optimum of an objective function f as opposed to stopping on the discovery at a local optimum. 30 In many cases, the difference between an arbitrary local minimum and the global minimum could mean a considerable performance loss. However, global optimization is significantly more challenging since there is no guaranteed way to find the global optimum without examining the entire search-space (i.e., traversing all combinations on M and D), which is often not feasible.…”
Section: ■ Results and Discussionmentioning
confidence: 99%
“…Global optimization methods attempt to find the global optimum of an objective function f as opposed to stopping on the discovery at a local optimum. 30 In many cases, the difference between an arbitrary local minimum and the global minimum could mean a considerable performance loss. However, global optimization is significantly more challenging since there is no guaranteed way to find the global optimum without examining the entire search-space (i.e., traversing all combinations on M and D), which is often not feasible.…”
Section: ■ Results and Discussionmentioning
confidence: 99%
“…In the next step, illustrated in Figure 2 , we aimed to identify the optimal value of an additional variable (symbolized by X ) that could be added to improve the regression model’s accuracy. This was formulated as black-box optimization [ 15 ], then solved using the Genetic Algorithm (GA) [ 16 ] due to its capability of providing good solutions in a reasonable time. The objective function of this optimization problem is to maximize the Pearson correlation coefficient (R-value) using a decision variable X that has a lower bound of 0 and an upper bound of 10.…”
Section: Methodsmentioning
confidence: 99%
“…The previous work with data profiles has assumed that the number of simplex evaluations (one dimension) is the dominant performance measure for testing how well a solver performs relative to the other solvers ( More & Wild, 2009 ; Audet & Hare, 2017 ). However, they did not investigate the performance of derivative free optimization solvers if a variety of metrics were used to evaluate the performance.…”
Section: Computational Experimentsmentioning
confidence: 99%
“…Such problems arise naturally in almost every branch of modern science and engineering. For example, pediatric cardiologists seek to delay the next operation as much as possible to identify the best shape of a surgical graft ( Audet & Hare, 2017 ). In this particular example, a number of variables can affect the objective function to treat and manage heart problems in children.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation