2019
DOI: 10.1088/1757-899x/577/1/012175
|View full text |Cite
|
Sign up to set email alerts
|

An extension of golden section algorithm for n-variable functions with MATLAB code

Abstract: Golden section search method is one of the fastest direct search algorithms to solve single variable optimization problems, in which the search space is reduced from [a, b] to [0,1]. This paper describes an extended golden section search method in order to find the minimum of an n-variable function by transforming its n-dimensional cubic search space to the zero-one n-dimensional cube. The paper also provides a MATLAB code for two-dimensional and three-dimensional golden section search algorithms for a zero-on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 12 publications
0
7
0
Order By: Relevance
“…It is noted that the base flow, the deep blue curve with circles, is separated from the observation by means of a straight line. Table 2 lists the estimated parameters of two lag and route models presented in Tab 1, in which the values in parenthesis of the third column come from the multi-dimension golden section search method recently suggested by [44]. In fact, the golden section searc method has been originally developed to solve the one-dimensional search problem therefore, we estimate đŸ (the value in the second column of Table 2) for the lag and rou version of a linear reservoir model with the same 𝑇 , such as the one used in the storag 1, in which the values in parenthesis of the third column come from the multi-dimensional golden section search method recently suggested by [44].…”
Section: Resultsmentioning
confidence: 99%
“…It is noted that the base flow, the deep blue curve with circles, is separated from the observation by means of a straight line. Table 2 lists the estimated parameters of two lag and route models presented in Tab 1, in which the values in parenthesis of the third column come from the multi-dimension golden section search method recently suggested by [44]. In fact, the golden section searc method has been originally developed to solve the one-dimensional search problem therefore, we estimate đŸ (the value in the second column of Table 2) for the lag and rou version of a linear reservoir model with the same 𝑇 , such as the one used in the storag 1, in which the values in parenthesis of the third column come from the multi-dimensional golden section search method recently suggested by [44].…”
Section: Resultsmentioning
confidence: 99%
“…GSS is one of the fastest direct search algorithms [23] to find the minimum or maximum value of a function. For the PHIL applications, GSS is to find the minimum of a function.…”
Section: B Iteration Methodsmentioning
confidence: 99%
“…(iii) Apply the twodimensional GSSA (2D GSSA) to Equation (36). With regard to the two-dimensional golden section search algorithm, one may refer to [43]. Remark 3.…”
Section: A Simple Methods For Nonlinear Eigenvalue Problemsmentioning
confidence: 99%