1964
DOI: 10.1093/comjnl/7.2.155
|View full text |Cite
|
Sign up to set email alerts
|

An efficient method for finding the minimum of a function of several variables without calculating derivatives

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

4
1,498
0
35

Year Published

1996
1996
2017
2017

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 4,005 publications
(1,537 citation statements)
references
References 0 publications
4
1,498
0
35
Order By: Relevance
“…For Al 55 , the results show an expansion of the jellium. We notice that even though the surface region in this case is contracted (∆r s 2 † =-0.068), the expansion of the inner region (∆r s 1 † =+0.206) is dominated and resulted in an overall expansion.…”
Section: B Sc-isjm Resultsmentioning
confidence: 88%
See 1 more Smart Citation
“…For Al 55 , the results show an expansion of the jellium. We notice that even though the surface region in this case is contracted (∆r s 2 † =-0.068), the expansion of the inner region (∆r s 1 † =+0.206) is dominated and resulted in an overall expansion.…”
Section: B Sc-isjm Resultsmentioning
confidence: 88%
“…The calculations then are repeated for different points in the {n 1 ,n 2 } parameter space (keeping the number of atoms in each region as fixed) until a local minimum is achieved. 55 The global minimum-energy state is then selected from the calculated local-minimum states for different t values, and thereby the equilibrium value, t † , is singled out. For t we arbitrarily use the values obtained from t = νd 100 in which ν takes positive integer values and d 100 is the distance between two adjacent (100) planes, being 3.82, 4.05, and 5.72 for Al, Na, and Cs, respectively.…”
Section: A Sc-isjmmentioning
confidence: 99%
“…We adopt the same likelihood function for RV modeling as Howard et al (2014): Powell (1964) to find the maximum likelihood model. Fifty parallel MCMC chains ("walkers") are then initialized by perturbing each of the free parameters from the maximum likelihood values by as much as 3%.…”
Section: Light-curve Analysismentioning
confidence: 99%
“…In order to solve the ND unconstrained optimization subproblem, we use Powell's conjugate direction method [17] as it requires only the objective function value and is more robust to noise in function evaluation, which is often the case with image based objective functions. For 1D optimization subproblem we employ Golden section with Swann's bounding [18].…”
Section: Convex Optimizationmentioning
confidence: 99%