Encyclopedia of Optimization 2008
DOI: 10.1007/978-0-387-74759-0_306
|View full text |Cite
|
Sign up to set email alerts
|

Interval Global Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 62 publications
0
4
0
Order By: Relevance
“…Interval arithmetic was standardized by the IEEE in 2015 [223]. Global optimization problems can be solved using the interval branch-and-bound method which iteratively splits the search space, and removes its parts that do not contain a global solution; multiple splitting schemes have been proposed in the literature [224]. In this case, application of interval arithmetic allows to guarantee, if a solution exists within a region of interest.…”
Section: Interval Methodsmentioning
confidence: 99%
“…Interval arithmetic was standardized by the IEEE in 2015 [223]. Global optimization problems can be solved using the interval branch-and-bound method which iteratively splits the search space, and removes its parts that do not contain a global solution; multiple splitting schemes have been proposed in the literature [224]. In this case, application of interval arithmetic allows to guarantee, if a solution exists within a region of interest.…”
Section: Interval Methodsmentioning
confidence: 99%
“…The existing optimization algorithms, such as gradient-based method, direct search method, intelligent method, and so on, can be flexibly selected to update the design variables for different kinds of engineering problems. [45][46][47] However, it should be noted that the computational burden caused by the nested loop will be huge, especially for the problems without explicit response functions. In order to improve the computational cost of parameter identification, a more efficient numerical method will be introduced in the next section for interval temperature response prediction.…”
Section: Nested-loop Optimization For Interval Parameter Identificationmentioning
confidence: 99%
“…From the flowchart, as shown in Figure , it easily can be seen that the interval parameter identification framework is a nested‐loop optimization model where the inner loop (listed in Steps 2 to 4) is employed to predict the bounds of computational response interval at feature points, and the outer loop (listed in Steps 1 to 7) is executed to capture the optimal bounds of interval input parameters. The existing optimization algorithms, such as gradient‐based method, direct search method, intelligent method, and so on, can be flexibly selected to update the design variables for different kinds of engineering problems –. However, it should be noted that the computational burden caused by the nested loop will be huge, especially for the problems without explicit response functions.…”
Section: Interval‐based Parameter Identification Frameworkmentioning
confidence: 99%
“…It delves into both single-variable and multi-variable scenarios, providing explanations and illustrations to demonstrate the application of the Interval Newt0n Method in tackling these optimization problems. Helmut Ratschek [4]explored interval methods in global optimization, providing solutions for diverse optimization scenarios, including unc0nstrained, constrained, and n0nsmooth optimization. It underscores the importance of bisection techniques in interval-based global optimization algorithms, where the problem domain is recursively divided and also acknowledges advancements in bisection strategies over the last decade.…”
Section: Introductionmentioning
confidence: 99%