2022
DOI: 10.1134/s1063454122040112
|View full text |Cite
|
Sign up to set email alerts
|

Application of the Nelder–Mead Method to Optimize the Way for Selection of the Likhachev–Volkov Model Constants

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…Finally, we search α$$ \alpha $$ and ()t1,,tK$$ \left({t}_1,\dots, {t}_K\right) $$ that minimize normalKL()α,t1,,tK$$ \mathrm{KL}\left(\alpha, {t}_1,\dots, {t}_K\right) $$ using the Nelder–Mead method, which is the algorithm for the optimization problem proposed by Nelder and Mead [21]. This method is still used today when the gradient function cannot be computed [12, 28]. In a series of programs, the user only needs to provide the prior samples ()bold-italicθ1,,bold-italicθN$$ \left({\boldsymbol{\theta}}_1,\dots, {\boldsymbol{\theta}}_N\right) $$ and their values q()bold-italicθi$$ q\left({\boldsymbol{\theta}}_i\right) $$.…”
Section: Ess For Priors With the Exponential Family Sampling Models W...mentioning
confidence: 99%
See 1 more Smart Citation
“…Finally, we search α$$ \alpha $$ and ()t1,,tK$$ \left({t}_1,\dots, {t}_K\right) $$ that minimize normalKL()α,t1,,tK$$ \mathrm{KL}\left(\alpha, {t}_1,\dots, {t}_K\right) $$ using the Nelder–Mead method, which is the algorithm for the optimization problem proposed by Nelder and Mead [21]. This method is still used today when the gradient function cannot be computed [12, 28]. In a series of programs, the user only needs to provide the prior samples ()bold-italicθ1,,bold-italicθN$$ \left({\boldsymbol{\theta}}_1,\dots, {\boldsymbol{\theta}}_N\right) $$ and their values q()bold-italicθi$$ q\left({\boldsymbol{\theta}}_i\right) $$.…”
Section: Ess For Priors With the Exponential Family Sampling Models W...mentioning
confidence: 99%
“…Finally, we search 𝛼 and (t 1 , … , t K ) that minimize KL(𝛼, t 1 , … , t K ) using the Nelder-Mead method, which is the algorithm for the optimization problem proposed by Nelder and Mead [21]. This method is still used today when the gradient function cannot be computed [12,28]. In a series of programs, the user only needs to provide the prior samples (𝜽 1 , … , 𝜽 N ) and their values q(𝜽 i ).…”
mentioning
confidence: 99%