2018
DOI: 10.1063/1.5034962
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of optimization algorithms for the slow shot phase in HPDC

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…Moreover, because the player had full freedom when designing the function, we assumed that a derivative-free method was required. Thus, we used a constrained optimization by the linear approximation (COBYLA) algorithm ( [50]), which is currently the most efficient method (good results are obtained in a relatively short time [22]). This numerical optimization method is applicable when the derivative of the objective function is not known, and it works by iteratively approximating the constrained numerical optimization problem with linear programming problems.…”
Section: Automated Parameter Tuningmentioning
confidence: 99%
“…Moreover, because the player had full freedom when designing the function, we assumed that a derivative-free method was required. Thus, we used a constrained optimization by the linear approximation (COBYLA) algorithm ( [50]), which is currently the most efficient method (good results are obtained in a relatively short time [22]). This numerical optimization method is applicable when the derivative of the objective function is not known, and it works by iteratively approximating the constrained numerical optimization problem with linear programming problems.…”
Section: Automated Parameter Tuningmentioning
confidence: 99%